Related papers: Repeated Sums and Binomial Coefficients
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
We consider the problem of characterizing solutions in $(x, y)$ to the equation ${x \choose y}={{x-a} \choose {y+b}}$ in terms of $a$ and $b$. We obtain one simple result which allows the determination of a ratio in terms of $a$ and $b$…
We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.
In this paper we discuss a class of double sums involving ratios of binomial coefficients. The sums are of the form \[ \sum_{j=0}^{n} \sum_{i=0}^j \frac{\binom{f_1(n)}{i}}{\binom{f_2(n)}{j}}\,c^{i-j}, \] where $f_1, f_2$ are functions of…
We provide a unified, probabilistic approach using renewal theory to derive some novel limits of sums for the normalized binomial coefficients and for the normalized Eulerian numbers. We also investigate some corresponding results for their…
Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index of the main products of graphs. Here, we obtain several…
There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers…
Sums of the form $\sum_{q \leq N_1 < \cdots < N_m \leq n}{a_{(m);N_m}\cdots a_{(2);N_2}a_{(1);N_1}}$ date back to the sixteen century when Vi\`ete illustrated that the relation linking the roots and coefficients of a polynomial had this…
Repeated integration is a major topic of integral calculus. In this article, we study repeated integration. In particular, we study repeated integrals and recurrent integrals. For each of these integrals, we develop reduction formulae for…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
A recent paper of A. Sofo proves some results about sums of products of quadratic alternating harmonic numbers and reciprocal binomial coefficients. In this paper, we extend his result to cubic alternating harmonic number sums and develop…
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
We briefly describe some well-known means and their properties, focusing on the relationship with integer sequences. In particular, the harmonic numbers, deriving from the harmonic mean, motivate the definition of a new kind of mean that we…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
The concept of a composed product for univariate polynomials has been explored extensively by Brawley, Brown, Carlitz, Gao, Mills, et al. Starting with these fundamental ideas and utilizing fractional power series representation (in…
We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…
Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.