A qq-analogue of the Biperiodic Fibonacci Sequence

preprint2015arXivOpen access

Abstract

The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation tn=atn−1+tn−2t_n=at_{n-1}+t_{n-2} if nn is even, tn=btn−1+tn−2t_n=bt_{n-1}+t_{n-2} if nn is odd, with initial values t0=0t_0=0 and t1=1t_1=1, where aa and bb are positive integers. This sequence is called biperiodic Fibonacci sequence. In this paper, we introduce a qq-analogue of this sequence. We prove several identities of qq-analogues of the Fibonacci sequence. We give algebraic and combinatorial proofs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.