相关论文: The coefficients of a Fibonacci power series

We give an explicit description of the coefficients of the formal power series (1-x)(1-x^2)(1-x^3)(1-x^5)(1-x^8)(1-x^13)... In particular, we show that all the coefficients are equal to -1, 0 or 1.

We determine the p-exponent in many of the coefficients in the power series (log(1+x)/x)^t, where t is any integer. In our proof, we introduce a variant of multinomial coefficients. We also characterize the power series x/log(1+x) by…

We will show that $(1-q)(1-q^2)\dots (1-q^m)$ is a polynomial in $q$ with coefficients from $\{-1,0,1\}$ iff $m=1,\ 2,\ 3,$ or $5$ and explore some interesting consequences of this result. We find explicit formulas for the $q$-series…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we have determined all the powers of 2 which are sums of five Fibonacci numbers with few exceptions that…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let $F_{n}$ be the Fibonacci numbers defined by the recurrence relation $F_{1}=1$, $F_{2}=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for all $n\geq 3$. We will find…

The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…

In this paper, we explore a variety of series involving the central binomial coefficients, highlighting their structural properties and connections to other mathematical objects. Specifically, we derive new closed-form representations and…

Given k>1, let a_n be the sequence defined by the recurrence a_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} for n>=k, with initial values a_0=a_1=...=a_{k-2}=0 and a_{k-1}= 1. We show under a couple of assumptions concerning the constants c_i…

As is well-known, the ratio of adjacent Fibonacci numbers tends to phi = (1 + sqrt(5))/2, and the ratio of adjacent Tribonacci numbers (where each term is the sum of the three preceding numbers) tends to the real root eta of X^3 - X^2 - X -…

The convolved Fibonacci numbers F_j^(r) are defined by (1-z-z^2)^{-r}=\sum_{j>=0}F_{j+1}^(r)z^j. In this note some related numbers that can be expressed in terms of convolved Fibonacci numbers are considered. These numbers appear in the…

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

Given that $a,b\in\mathbb N$, $c_0,c_1\in\mathbb Z$, $(c_0,c_1)\neq (0,0)$, and a generalized Fibonacci sequence $(s_n)_{n\geq 0}$ where $s_0 = c_0$, $s_1 = c_1$, and $s_{n+1}=as_{n}+bs_{n-1}$ for all positive integers $n$. In this paper,…

Consider the sequences: $ \{F_{n}\}_{n\geq 0} $ of Fibonacci numbers defined by $ F_0=0 $, $ F_1 =1$ and $ F_{n+2}=F_{n+1}+ F_{n} $ for all $ n\geq 0 $; $ \{P_{n}\}_{n\geq 0} $ of Padovan numbers defined by $ P_0=0 $, $ P_1 =1 = P_2 $ and $…

We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…

We prove that the sequence $(1/F_{n+2})_{n\ge 0}$ of reciprocals of the Fibonacci numbers is a moment sequence of a certain discrete probability, and we identify the orthogonal polynomials as little $q$-Jacobi polynomials with…

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 classify all solution triples with Fibonacci components to the equation $a^2+b^2+c^2=3abc+m,$ for positive $m$. We show that for $m=2$ they are precisely $(1,F(b),F(b+2))$, with even $b$; for $m=21$, there exist exactly two Fibonacci…

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…