1.Previous
3.Next

have been given, the rest of the sequence can be calculated by repeatedly applying the equation.

In linear recurrences, the th term is equated to a linear function of the previous terms. A famous example is the recurrence for the Fibonacci numbers,

where the order is two and the linear function merely adds the two previous terms. This example is a linear recurrence with constant coefficients,

1.Previous
3.Next