Applications of Fibonacci Numbers 1990
DOI: 10.1007/978-94-009-1910-5_28
|View full text |Cite
|
Sign up to set email alerts
|

Some Binomial Fibonacci Identities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

1999
1999
2021
2021

Publication Types

Select...
5
2
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 1 publication
0
7
0
Order By: Relevance
“…The new method presented in this paper provides some illumination on some observations noted by researchers (for example Long [15], Dresel [3] and Melham [17]).…”
Section: Introductionmentioning
confidence: 78%
“…The new method presented in this paper provides some illumination on some observations noted by researchers (for example Long [15], Dresel [3] and Melham [17]).…”
Section: Introductionmentioning
confidence: 78%
“…Of course, these numbers can also be defined recursively since the identities W 0 = a, W 1 = b, W n = p W n−1 + W n−2 and X 0 = 2 b − a p, X 1 = 2 a+ b p, X n = p X n−1 + X n−2 are true for all integers n. Moreover, W n and X n generalize U n and V n , respectively, which in turn generalize F n and L n (Fibonacci and Lucas numbers), respectively. Aspects of W n and X n have been treated, for example, in [1], [13], and [21], and more recently in [15].…”
Section: Introductionmentioning
confidence: 99%
“…(X, X) . Sums involving Fibonacci, Lucas, Pell and Pell-Lucas numbers and generalizations have been studied by several authors, for example, for trigonometric sums see Melham [6,1999] and Belbachir & Bencherif [1,2007], for reciprocal and powers sums see Melham [7,1999] and [8,2000], and for the sum of squares see Long [5,1986], Čerin [2,2005] and Čerin & Gianella [3,2006].…”
Section: Introduction and Main Resultsmentioning
confidence: 99%