Related papers: Fibonacci q-gaussian sequences
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…
Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.
The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation $t_n=at_{n-1}+t_{n-2}$ if $n$ is even, $t_n=bt_{n-1}+t_{n-2}$ if $n$ is odd, with initial values $t_0=0$ and $t_1=1$, where $a$ and $b$ are…
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…
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$.
In this paper, closed forms of the summation formulas for generalized Tribonacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of…
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients.
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…
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 prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
Starting with some determinants of binomial coefficients which are related to Fibonacci and Lucas polynomials we study similar determinants for some generalizations of these polynomials and their q-analogues.
By using Andrews's explicit formulae of the $q$-Fibonacci sequence introduced by Schur, we prove certain congruences of the $q$-Fibonacci sequence which relate the sequence with the original Fibonacci sequence. As a corollary, we show that…
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 define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
We show that Genocchi and Bernoulli numbers are closely related to Fibonacci polynomials and derive some q-analogues.
We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…