2009
DOI: 10.1155/2009/709386
|Get access via publisher |Summarize |Cite
|
Sign up to set email alerts

On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2

Abstract: Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2. The applications of the method to the Fibonacci and Lucas numbers, Chebyshev polynomials, the generalized Gegenbauer-Humbert polynomials are also discussed. The derived idea provides a general method to construct identities of number or polynomial sequences defined by linear recurrence relations. The applications using the method to solve some algebraic a… Show more

Search citation statements

Order By: Relevance

Paper Sections

Select...
18
4
1
0

Citation Types

0
33
0
0

Year Published

Range
2010
2010
2026
2026

Publication Types

Select...
16
6

Relationship

6
16

Authors

Journals

citations

Cited by 22 publications

(33 citation statements)
references

References 22 publications

0
33
0
0
Order By: Relevance
How this paper cites the one you are viewing
“…The recurrence (2.23) in [86,2009] by Tian-Xiao He and Peter Jau-Shyong Shiue defines exactly the class of Ward-Horadam functions' second order sequences and this paper standard Jacques Binet form ( 21), ( 22) of the recurrence (3) solution for Ward-Horadam functions sequences H(x) constitutes the content of their Proposition 2.7. -as has been mentioned earlier.…”
Section: Let Us Recall Convention Resulting From (3)
mentioning
confidence: 97%