We can rearrange this to get a recurrence relation for A.
Every recurrence relation can be formulated as a difference equation.
This is a recurrence relation giving in terms of .
However, "difference equation" is frequently used to refer to any recurrence relation.
A simple form of functional equation is a recurrence relation.
A common method in this form of modelling is to use recurrence relations.
Find a closed formula for a sequence given in a recurrence relation.
These two cases include all possibilities, so the recurrence relation follows.
These values are easy to generate using the recurrence relation in the previous section.
In fact, this is no longer a recurrence relation but a functional equation.