Double-Recurrence Fibonacci Numbers and Generalizations
Abstract
Let (Fn)n≥ 0 be the Fibonacci sequence given by the recurrence Fn+2=Fn+1+Fn, for n≥ 0, where F0=0 and F1=1. There are several generalizations of this sequence and also several interesting identities. In this paper, we investigate a homogeneous recurrence relation that, in a way, extends the linear recurrence of the Fibonacci sequence for two variables, called double-recurrence Fibonacci numbers, given by F(m,n) = F(m-1, n-1)+F (m-2, n-2), for n,m≥ 2, where F (m, 0) = Fm, F (m, 1) = Fm+1, F (0, n) = Fn and F (1, n) = Fn+1. We exhibit a formula to calculate the values of this double recurrence, only in terms of Fibonacci numbers, such as certain identities for their sums are outlined. Finally, a general case is studied.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.