Patterns and Sequences
Recursive Sequences
A recursive sequence defines each term using the term (or terms) before it, rather than a direct formula in terms of n. For example, an = an-1 + 3 means each term is 3 more than the previous one.
The most famous recursive sequence is the Fibonacci sequence, where each term is the sum of the two terms before it: an = an-1 + an-2.
Practice: Recursive Sequences
Compute a term from a recursive rule, including Fibonacci-like sequences.