Home Mathematics A New Generalization of Fibonacci Sequence & Extended Binet's Formula
Article
Licensed
Unlicensed Requires Authentication

A New Generalization of Fibonacci Sequence & Extended Binet's Formula

  • Marcia Edson and Omer Yayenie
Published/Copyright: January 26, 2010
Become an author with De Gruyter Brill
Integers
From the journal Volume 9 Issue 6

Abstract

Consider the Fibonacci sequence having initial conditions F0 = 0, F1 = 1 and recurrence relation Fn = Fn–1 + Fn–2 (n ≥ 2). The Fibonacci sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this article, we study a new generalization {qn}, with initial conditions q0 = 0 and q1 = 1 which is generated by the recurrence relation qn = aqn–1 + qn–2 (when n is even) or qn = bqn–1 + qn–2 (when n is odd), where a and b are nonzero real numbers. Some well-known sequences are special cases of this generalization. The Fibonacci sequence is a special case of {qn} with a = b = 1. Pell's sequence is {qn} with a = b = 2 and the k-Fibonacci sequence is {qn} with a = b = k. We produce an extended Binet's formula for the sequence {qn} and, thereby, identities such as Cassini's, Catalan's, d'Ocagne's, etc.

Received: 2008-07-21
Revised: 2009-05-08
Accepted: 2009-08-08
Published Online: 2010-01-26
Published in Print: 2009-December

© de Gruyter 2009

Downloaded on 22.2.2026 from https://www.degruyterbrill.com/document/doi/10.1515/INTEG.2009.051/html
Scroll to top button