Recursive — Definition, Formula & Examples

Recursive means defining each term in a sequence by referring back to one or more previous terms. Instead of a direct formula for the

n

th term, a recursive rule tells you how to get the next term from the ones you already know.

A recursive definition of a sequence specifies one or more initial terms (base cases) together with a recurrence relation that expresses each subsequent term $a_n$ as a function of preceding terms $a_{n-1}, a_{n-2}, \ldots$ .

Key Formula

a_n = f(a_{n-1},\, a_{n-2},\, \ldots)\quad \text{with initial term(s) given}

Where:

$a_n$ = The term you want to find
$a_{n-1}, a_{n-2}, \ldots$ = One or more previously computed terms
$f$ = The recurrence relation (rule connecting terms)

How It Works

A recursive definition always has two parts: the starting value(s) and the rule that connects each term to the previous one(s). To find a specific term, you start from the initial value and apply the rule repeatedly. For example, the Fibonacci sequence is defined recursively:

a_1 = 1

a_2 = 1

, and

a_n = a_{n-1} + a_{n-2}

for

n \geq 3

. You cannot jump directly to the 10th term without computing the terms before it — that is the key distinction between a recursive formula and an explicit (closed-form) formula.

Worked Example

Problem: A sequence is defined recursively by

a_1 = 3

and

a_n = 2a_{n-1} + 1

. Find

a_4

Step 1: Start with the given initial term.

a_1 = 3

Step 2: Apply the rule to find the next term.

a_2 = 2a_1 + 1 = 2(3) + 1 = 7

Step 3: Continue applying the rule for each successive term.

a_3 = 2a_2 + 1 = 2(7) + 1 = 15

Step 4: One more application gives the fourth term.

a_4 = 2a_3 + 1 = 2(15) + 1 = 31

Answer:

a_4 = 31

Why It Matters

Recursive thinking is central to computer science algorithms like sorting and searching, where problems are broken into smaller copies of themselves. In precalculus and discrete math courses, you will encounter recursive definitions for arithmetic sequences, geometric sequences, and the Fibonacci sequence. Understanding recursion also lays the groundwork for mathematical induction proofs.

Common Mistakes

Mistake: Trying to use a recursive formula without knowing the initial term(s).

Correction: A recursive definition is incomplete without its base case. Always identify the starting value(s) before applying the recurrence relation.