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, a_n = a_n-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: a_n = a_n-1 + a_n-2.

Compute a term from a recursive rule, including Fibonacci-like sequences.

Continue exploring related topics:

• Sequence Sums
• Fibonacci Sequence - Nature's Own Number Pattern
• Arithmetic Sequences - nth Term and Sum