Generalized Fibonacci sequences and their properties

From MaRDI portal



Abstract: Let Fn(k) be the generalized Fibonacci number defined by (with Fi(k) abbreviated to Fi): Fn=Fn−1+Fn−2+dots+Fn−k, for ngeqk, and the initial values (F0,F1,...,Fk−1). Let Bn(k,j) be Fn(k) with initial values given by Fj=1 and, for i<j and j<i<k, Fi=0. This paper shows that any Fn(k) can be expressed as the sum of Bn(k,j)s. This paper also expresses Bn(k,j) and Fn(k) as finite sums, derives some properties and evaluates their 2-adic order for a range of values of k,j and n and those of Bn(3,j) and Bn(4,j) for most values of j and n.














This page was built for publication: Generalized Fibonacci sequences and their properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6371605)