Related papers: General convolution sums involving Fibonacci m-ste…
In this article, we introduce the simplicial $d$-polytopic numbers defined on generalized Fibonacci polynomials. We establish basic identities and find $q$-identities known. Furthermore, we find generating functions for the simplicial…
For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,...,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In 2005, Noe and Post conjectured…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
In this paper, we introduce relations between binomial sums involving (generalized) Fibonacci and Lucas numbers, and different kinds of binomial coefficients. We also present some relations between sums with two and three binomial…
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, $k$-Fibonacci words, and their combinatorial properties. We established that the $n$-th root of the absolute value of terms in…
In this paper we derive some new identities involving the Fibonacci and Lucas polynomials and the Chebyshev polynomials of the first and the second kind. Our starting point is a finite trigonometric sum which equals the resolvent kernel on…
As a generalization of planar Fibonacci spirals that are based on the recurrence relation $F_n=F_{n-1}+F_{n-2}$, we draw assembled spirals stemming from analytic solutions of the recurrence relation $G_n=a\, G_{n-1}+b\, G_{n-2}+c\, d\,^n$,…
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…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
Let $F_k$ be the $k$th Fibonacci number. Let $(G_k)_{k\in\mathbb Z}$ be any sequence obeying the recurrence relation of the Fibonacci numbers. We employ the Gerin-Ces\`aro identity and an identity of Brousseau to evaluate the following…
We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci…
In this note, we present a simple summation formula for $k$-bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a…
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…
We give one parameter generalizations of the Fibonacci and Lucas numbers denoted by $\{F_n(\th)\}$ and $\{L_n(\th)\}$, respectively. We evaluate the Hankel determinants with entries $\{1/F_{j+k+1}(\th): 0\le i,j \le n\}$ and…
We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence,…
By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…
We prove a master identity for a class of sequences defined by full-history linear homogeneous recurrences with (non-negative) constant coefficients. The identity is derived in a combinatorial way, providing thus combinatorial proofs for…