Generalized Fibonacci sequences and their properties

Abstract

Let Fn(k) be the generalized Fibonacci number defined by (with Fi(k) abbreviated to Fi): Fn = Fn-1 + Fn-2 + … + Fn-k, for n ≥ k, 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…