English

Generalized Fibonacci sequences and their properties

Number Theory 2021-07-01 v1

Abstract

Let Fn(k)F_n(k) be the generalized Fibonacci number defined by (with Fi(k)F_i(k) abbreviated to FiF_i): Fn=Fn1+Fn2++FnkF_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}, for nkn \geq k, and the initial values (F0,F1,...,Fk1)(F_0,F_1,...,F_{k-1}). Let Bn(k,j)B_n(k,j) be Fn(k)F_n(k) with initial values given by Fj=1F_j = 1 and, for i<ji<j and j<i<kj<i<k, Fi=0F_i = 0. This paper shows that any Fn(k)F_n(k) can be expressed as the sum of Bn(k,j)B_n(k,j)s. This paper also expresses Bn(k,j)B_n(k,j) and Fn(k)F_n(k) as finite sums, derives some properties and evaluates their 2-adic order for a range of values of k,jk, j and nn and those of Bn(3,j)B_n(3,j) and Bn(4,j)B_n(4,j) for most values of jj and nn.

Keywords

Cite

@article{arxiv.2106.15790,
  title  = {Generalized Fibonacci sequences and their properties},
  author = {Martin Bunder and Joseph Tonien},
  journal= {arXiv preprint arXiv:2106.15790},
  year   = {2021}
}
R2 v1 2026-06-24T03:44:45.877Z