International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

An Interesting Generalization of Fibonacci & Lucas Sequence

Vandana R. Patel, Devbhadra V. Shah

Abstract: In this paper, we consider the generalisation of classical Fibonacci sequence and Lucas sequence. We consider the sequence{H_n }defined by the recurrence relation H_n= H_ (n-1) +H_ (n-2), for all n-2, with H_0=2m, H_1=k+m, where m, k are fixed integers. The initial conditions are the sum ofk times the initial conditions of Fibonacci sequence and m times the initial conditions of Lucas sequence. Using the technique of generating functions, we obtain the extended Binet formula for H_n. We obtain some fascinating properties for this sequence. We also establish some amusing identities for this sequence displaying the relation betweenH_n, Fibonacci sequence and Lucas sequence

Keywords: Fibonacci sequence, Lucas sequence, generating function, Generalized Fibonacci sequence

How to Cite?: Vandana R. Patel, Devbhadra V. Shah, "An Interesting Generalization of Fibonacci & Lucas Sequence", Volume 4 Issue 12, December 2015, International Journal of Science and Research (IJSR), Pages: 1942-1945, https://www.ijsr.net/getabstract.php?paperid=NOV152456, DOI: https://dx.doi.org/10.21275/NOV152456

Download Citation: APA | MLA | BibTeX | EndNote | RefMan

Share This Research

Help this article reach readers, researchers and professionals.

Share activity is measured for research-engagement analytics. Only verified, unique public shares can support award tie-breaking.

Confirm Your Share

Enter your details so IJSR can confirm this sharing activity.

Your details are used to validate this share and protect the award process from duplicate or false activity.

Download Article PDF


Rate This Article!

Top

Confirm Your Share

Enter your details so IJSR can confirm this sharing activity.

Your details are used to validate this share and protect the award process from duplicate or false activity.