Related papers: Some Weighted Generalized Fibonacci Number Summati…
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…
We present a differential-calculus-based method which allows one to derive more identities from {\it any} given Fibonacci-Lucas identity containing a finite number of terms and having at least one free index. The method has two {\it…
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
A second order polynomial sequence is of Fibonacci type (Lucas type) if its Binet formula is similar in structure to the Binet formula for the Fibonacci (Lucas) numbers. In this paper we generalize identities from Fibonacci numbers and…
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
We generalize a terminating summation formula to a unilateral nonterminating, and further, a bilateral summation formula by a property of analytic functions. The unilateral one is proved to be a $q$-analogue of a $_4F_3$-summation formula.…
The aim of this paper is to present a comprehensive survey of cubic Fibonacci identities, trying to uncover as many as possible. From the outset, our rationale for a very careful search on an apparently obscure problem was not only a matter…
Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…
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 $…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…
This paper is concerned with developing some new identities of generalized Fibonacci numbers and generalized Pell numbers. A new class of generalized numbers is introduced for this purpose. The two well-known identities of Sury and Marques…
By expressing Fibonacci and Lucas numbers in terms of the powers of the golden ratio, $\alpha=(1+\sqrt 5)/2$ and its inverse, $\beta=-1/\alpha=(1-\sqrt 5)/2$, a multitude of Fibonacci and Lucas identities have been developed in the…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
In this paper, for the generalized Fibonacci sequence $\left\{W_n\left(a,b,p,q\right)\right\}$, by using elementary methods and techniques, we give the asymptotic estimation values of…
We study certain series with Catalan numbers and reciprocal Catalan numbers, respectively, and provide seemingly new closed form evaluations of these series with Fibonacci (Lucas) entries. In addition, we state some combinatorial sums that…
Finite trigonometric sums occur in various branches of physics, mathematics, and their applications. These sums may contain various powers of one or more trigonometric functions. Sums with one trigonometric function are known, however sums…
Based on well-known properties of Fibonacci and Lucas numbers and polynomials we give a self-contained approach to some bivariate analogs.
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…