Related papers: Fibonacci-Lucas densities
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…
This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…
In this work, we made a generalization that includes all bicomplex Fibonacci-like numbers such as; Fibonacci, Lucas, Pell, etc.. We named this generalization as bicomplex Horadam numbers. For bicomplex Fibonacci and Lucas numbers we gave…
This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…
Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…
We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…
This note gives an elementary exposition of a variant of the spread polynomials in terms of Fibonacci and Lucas polynomials.
In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…
In this paper we discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect…
We show that certain weighted Fibonacci and Lucas series can always be expressed as linear combinations of polylogarithms. In some special cases we evaluate the series in terms of Bernoulli polynomials, making use of the connection between…
In this paper, we look at numbers of the form $H_{r,k}:=F_{k-1}F_{r-k+2}+F_{k}F_{r-k}$. These numbers are the entries of a triangular array called the \emph{determinant Hosoya triangle} which we denote by ${\mathcal H}$. We discuss the…
In this paper, we present a constructive bijection between a conditioned spanning forest of the wheel graph $W_{n+1}$ and a spanning tree of the fan graph $F_n$. In addition, by applying the effective resistance formula obtained by Bapat…
We present some new linear, quadratic, cubic and quartic binomial Fibonacci, Lucas and Fibonacci--Lucas summation identities.
We considered the properties of generalized Fibonacci and Lucas numbers class. The analogues of well-known Fibonacci identities for generalized numbers are obtained. We gained a new identity of product convolution of generalized Fibonacci…
We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.
Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…
We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.