2007
DOI: 10.1016/j.chaos.2006.09.022
|View full text |Cite
|
Sign up to set email alerts
|

On the Fibonacci k-numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
182
0
3

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 256 publications
(186 citation statements)
references
References 32 publications
1
182
0
3
Order By: Relevance
“…The well-known Binet formula in the Fibonacci numbers theory [5,3,1] allows us to express the k-Fibonacci and the kLucas numbers by mean of the roots As a result of the above,…”
Section: Definition Of the K-fibonacci Numbersmentioning
confidence: 99%
See 1 more Smart Citation
“…The well-known Binet formula in the Fibonacci numbers theory [5,3,1] allows us to express the k-Fibonacci and the kLucas numbers by mean of the roots As a result of the above,…”
Section: Definition Of the K-fibonacci Numbersmentioning
confidence: 99%
“…There exist generalizations of the classical Fibonacci numbers given by many researchers as Horadam [4] and recently by Falcon and Plaza [3].…”
Section: Introductionmentioning
confidence: 99%
“…Falcon and Plaza [1] showed some results of the k-Fibonacci sequence   k,n Then many researchers [3][4][5] showed some results of the k-Fibonacci-Like number in 2014.…”
Section: Introductionmentioning
confidence: 99%
“…The k−Fibonacci sequence introduced by Falcon and Plaza [3] depends only on one integer parameter k and is de ned as F k, = , F k, = and F k,n+ = kF k,n + F k,n− , where n ≥ , k ≥ . In particular, if k = , the Pell sequence is obtained as P = , P = and P n+ = Pn +P n− for n ≥ .…”
Section: Introductionmentioning
confidence: 99%