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

The k-Fibonacci sequence and the Pascal 2-triangle

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
117
0
2

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 169 publications
(119 citation statements)
references
References 31 publications
0
117
0
2
Order By: Relevance
“…This study has been motivated by the arising of two complex valued maps to represent the two antecedents in an specific four-triangle partition. In [12], Falcon and Plaza k-Fibonacci sequence generalizes, between others, both the classical Fibonacci sequence and the Pell sequence. In this paper many properties of these numbers are deduced and related with the so-called Pascal 2-triangle.…”
Section: Introductionmentioning
confidence: 80%
“…This study has been motivated by the arising of two complex valued maps to represent the two antecedents in an specific four-triangle partition. In [12], Falcon and Plaza k-Fibonacci sequence generalizes, between others, both the classical Fibonacci sequence and the Pell sequence. In this paper many properties of these numbers are deduced and related with the so-called Pascal 2-triangle.…”
Section: Introductionmentioning
confidence: 80%
“…For any integer 1 k  , the k-Fibonacci sequence, say   For the properties of the k-Fibonacci numbers, see [3,4].…”
Section: Definition Of the K-fibonacci Numbersmentioning
confidence: 99%
“…, we find the following two formulas for the k-Fibonacci numbers according to that n is odd or even [2]:…”
Section: Cofactor Matrix Of Hmentioning
confidence: 99%
“…We define the k-Fibonacci numbers [1,2,3] by mean of the recurrence relation F k,n+1 = k F k,n + F k,n−1 for n ≥ 1 with the initial conditions F k,0 = 0 and F k,1 = 1.…”
Section: Introductionmentioning
confidence: 99%