Related papers: Recurrence Formulas for Fibonacci Sums
We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…
The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…
We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution.…
The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…
We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.
Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…
Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…
The sequence of partial sums of Fibonacci numbers, beginning with $2$, $4$, $7$, $12$, $20$, $33,\dots$, has several combinatorial interpretations (OEIS A000071). For instance, the $n$-th term in this sequence is the number of length-$n$…
A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…
We investigate a connection between generalized Fibonacci numbers and renewal theory for stochastic processes. Using Blackwell's renewal theorem we find an approximation to the generalized Fibonacci numbers. With the help of error estimates…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Cerin and Z. Cerin & G. M. Gianella, more easily.
The objective of this manuscript is to offer explicit expressions for diverse categories of infinite series incorporating the Fibonacci (Lucas) sequence and the Riemann zeta function. In demonstrating our findings, we will utilize…
In this paper, we find the sums in closed form of certain type of Lucas-related convergent series. More precisely, we generalize the results already obtained by the author in his arXiv paper entitled: "Summation of certain infinite…
This paper studies eight families of infinite series involving hyperbolic functions. Under some conditions, these series are linear combinations of derivatives of Eisenstein series. The paper gives a systematic method for computing the…
This paper presents the equality of finite index sums of Bessel func- tions containing arbitrary numbers of terms. These reduce to the familiar three term recursion formulas in simple cases.
We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums…
We determine the order of magnitude of the variance of the Fibonacci partition function. The answer is different to the most naive guess. The proof involves a diophantine system and an inhomogeneous linear recurrence.