Generalization of the Fibonacci Sequence in Case of Third Order Recurrence Relation

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Home

Generalization of the Fibonacci Sequence in Case of Third Order Recurrence Relation

Author:

SANJAY HARNE1, V.H.BADSHAH2, SHUBHRAJ PAL3 and VIBHOJ PARSAI4

Affiliation:

1Department of Mathematics, Govt. Holkar Science College, Indore (M.P.) (India)
2School of Studies in Mathematics, Vikram University, Ujjain (M.P.) (India)
3Department of Mathematics, P.M.B. Gujarati Science College, Indore (M.P.) (India)
4Department of Mathematics, P.M.B. Gujarati Science College, Indore (M.P.) (India)
Email of Corresponding Author : sanjaykeshavharne@yahoo.co.in

Keyword:

Fibonacci sequence, recurrence relation

Issue Date:

August, 2016

Abstract:

In this paper we generate pair of integer sequences using third
order recurrence relation
pn+3 = qn+2 + qn+1 + qn n > 0
qn+3 = pn+2 + pn+1 + pn n > 0
This process of constructing two sequences  
pi i0 and
 
qi i0 is called 2-Fibonacci sequences5

Pages:

ISSN:

2319-8044 (Online) - 2231-346X (Print)

Source:

Vol.28 - No.3

PDF:

Click here to download full paper

DOI:

Share This:

Copy the following to cite this article:

SANJAY HARNE1, V.H.BADSHAH2, SHUBHRAJ PAL3 and VIBHOJ PARSAI4, "Generalization of the Fibonacci Sequence in Case of Third Order Recurrence Relation", Journal of Ultra Scientist of Physical Sciences, Volume 28, Issue 3, Page Number , 2016

Copy the following to cite this URL:

Available from: https://www.ultrascientist.org/paper/402/

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License