Theory of Binet formulas for Fibonacci and Lucas p-numbers

Alexey Stakhov and Boris Rozin

Chaos, Solitons & Fractals, 2006, vol. 27, issue 5, 1162-1177

Abstract: Modern natural science requires the development of new mathematical apparatus. The generalized Fibonacci numbers or Fibonacci p-numbers (p=0,1,2,3,…), which appear in the “diagonal sums” of Pascal’s triangle and are assigned in the recurrent form, are a new mathematical discovery. The purpose of the present article is to derive analytical formulas for the Fibonacci p-numbers. We show that these formulas are similar to the Binet formulas for the classical Fibonacci numbers. Moreover, in this article, there is derived one more class of the recurrent sequences, which is defined to be a generalization of the Lucas numbers (Lucas p-numbers).

Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077905004637
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:27:y:2006:i:5:p:1162-1177

DOI: 10.1016/j.chaos.2005.04.106

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().