Category:Recurrence Relations
Jump to navigation
Jump to search
This category contains results about Recurrence Relations.
Definitions specific to this category can be found in Definitions/Recurrence Relations.
A recursive sequence is a sequence where each term is defined from earlier terms in the sequence.
A famous example of a recursive sequence is the Fibonacci sequence:
- $F_n = F_{n-1} + F_{n-2}$
The equation which defines this sequence is called a recurrence relation or difference equation.
Subcategories
This category has only the following subcategory.
R
Pages in category "Recurrence Relations"
The following 8 pages are in this category, out of 8 total.
R
- Recurrence Formula for Bessel Function of the First Kind
- Recurrence Formula for Sum of Sequence of Fibonacci Numbers
- Recurrence Relation for Bell Numbers
- Recurrence Relation for Digamma Function
- Recurrence Relation for Euler Numbers
- Recurrence Relation for General Harmonic Numbers
- Recurrence Relation for Polygamma Function
- Recurrence Relation for Polylogarithms