English

Double-Recurrence Fibonacci Numbers and Generalizations

Number Theory 2019-03-19 v1

Abstract

Let (Fn)n0(F_n)_{n\geq 0} be the Fibonacci sequence given by the recurrence Fn+2=Fn+1+FnF_{n+2}=F_{n+1}+F_n, for n0n\geq 0, where F0=0F_0=0 and F1=1F_1=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 {\it double-recurrence Fibonacci numbers}, given by F(m,n)=F(m1,n1)+F(m2,n2){F(m,n) = F(m-1, n-1)+F (m-2, n-2)}, for n,m2n,m\geq 2, where F(m,0)=FmF (m, 0) = F_m, F(m,1)=Fm+1F (m, 1) = F_{m+1}, F(0,n)=FnF (0, n) = F_n and F(1,n)=Fn+1F (1, n) = F_{n+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.

Keywords

Cite

@article{arxiv.1903.07490,
  title  = {Double-Recurrence Fibonacci Numbers and Generalizations},
  author = {Carlos Alirio Rico Acevedo and Ana Paula Chaves},
  journal= {arXiv preprint arXiv:1903.07490},
  year   = {2019}
}

Comments

10 pages, 5 figures and 1 table

R2 v1 2026-06-23T08:11:37.011Z