A q-analogue of the Biperiodic Fibonacci Sequence
Abstract
The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation tn=atn-1+tn-2 if n is even, tn=btn-1+tn-2 if n is odd, with initial values t0=0 and t1=1, where a and b are positive integers. This sequence is called biperiodic Fibonacci sequence. In this paper, we introduce a q-analogue of this sequence. We prove several identities of q-analogues of the Fibonacci sequence. We give algebraic and combinatorial proofs.
0
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.