A q-analogue of the bi-periodic Fibonacci sequence

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Abstract: The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation

t_{n} = a t_{n - 1} + t_{n - 2}

if

n

is even,

t_{n} = b t_{n - 1} + t_{n - 2}

if

n

is odd, with initial values

t_{0} = 0

and

t_{1} = 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.

Recommendations

Cited in

(11)

Describes a project that uses

Uses Software

This page was built for publication: A \(q\)-analogue of the bi-periodic Fibonacci sequence