A recursive sequence is a sequence of numbers where each term is defined using one or more previous terms. Instead of a single formula that calculates any term directly, a recursive sequence gives you a starting value and a rule for building the next term from what came before. Every recursive sequence needs two things: at least one initial value (called a seed or base case) and a recurrence relation that describes how to get from one term to the next.
How a Recursive Sequence Works
Think of a recursive sequence like a chain. You know where the chain starts, and you know how each link connects to the one before it. To find any term, you apply the rule repeatedly, stepping forward one term at a time.
Here’s a simple example. Suppose the first term is 1, and each new term equals twice the previous term plus 1. Written out, that looks like: a₁ = 1, and aₙ = 2aₙ₋₁ + 1 for every term after the first. Plugging in, you get 1, 3, 7, 15, 31, and so on. Each term depends entirely on the one before it. Without knowing aₙ₋₁, you can’t calculate aₙ.
The subscript notation is standard across math textbooks. The symbol aₙ means “the nth term,” aₙ₋₁ means “the term right before it,” and aₙ₋₂ means “two terms back.” Some sequences start counting at n = 0 instead of n = 1, which is common in computer science and certain branches of math.
Arithmetic and Geometric Sequences
Two of the most common recursive sequences show up early in algebra courses. An arithmetic sequence adds the same number each time. If the first term is 3 and you add 2 to get each new term, the recursive formula is: a(1) = 3, a(n) = a(n−1) + 2. That constant addition (2 in this case) is called the common difference. The sequence produces 3, 5, 7, 9, 11, and continues climbing by 2 forever.
A geometric sequence multiplies by the same number each time instead of adding. If the first term is −71 and you multiply by 4.2 to get each new term, the recursive formula is: f(1) = −71, f(n) = f(n−1) · 4.2. That multiplier is called the common ratio. Geometric recursion shows up constantly in finance, where compound interest works by multiplying a balance by the same growth factor each period.
The Fibonacci Sequence
The Fibonacci sequence is the most famous recursive sequence, and it illustrates an important point: a recursive rule can look back more than one step. The Fibonacci sequence starts with two seed values, a₁ = 0 and a₂ = 1. From there, every term is the sum of the two terms before it: aₙ = aₙ₋₁ + aₙ₋₂ for n > 2. This produces 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on.
Because the rule references two previous terms, you need two initial values to get the sequence started. A recursive sequence that only looks back one step needs just one seed value. The number of initial values always matches how far back the rule reaches.
Recursive vs. Explicit Formulas
An explicit formula (sometimes called a closed-form formula) lets you jump straight to any term without calculating the ones before it. A recursive formula forces you to work through every term in order. Both describe the same sequence, but they serve different purposes.
For example, the sequence of positive even numbers can be defined recursively as e₁ = 2, eₙ = eₙ₋₁ + 2. Or it can be defined explicitly as eₙ = 2n. With the explicit formula, you can find the 100th term instantly: 2 × 100 = 200. With the recursive formula, you’d need to compute all 99 terms before it. That gets tedious fast.
So why use recursive formulas at all? Because many sequences don’t have a clean explicit formula. The Fibonacci sequence, for instance, does have an explicit form, but it involves irrational numbers and is far less intuitive than the simple “add the last two terms” rule. Recursive definitions are often easier to discover, easier to understand, and sometimes the only practical option for describing complex patterns.
Where Recursive Sequences Converge
Some recursive sequences settle toward a specific value instead of growing forever. When the sequence xₙ₊₁ = f(xₙ) converges, the value it approaches is called a fixed point. At that point, applying the rule doesn’t change the value anymore, so f(x) = x.
Whether a sequence converges depends on the rule and the starting value. A sequence like xₙ₊₁ = 0.5xₙ with x₁ = 100 produces 100, 50, 25, 12.5, and so on, clearly shrinking toward 0. The fixed point is 0, because half of 0 is still 0. In general, if the rule “contracts” values (pulls them closer together with each step), the sequence will converge. If it stretches values apart, the sequence typically diverges or behaves chaotically.
Real-World Applications
Finance
Compound interest is a geometric recursive sequence. If you invest $90,000 in an asset that loses 14% of its value each year, the balance after each year is 86% of the previous balance. The recurrence relation is Vₙ₊₁ = 0.86 · Vₙ, with V₀ = 90,000. You can trace the value year by year: $90,000, then $77,400, then $66,564, and so on. The same structure applies to savings accounts, loan amortization, and depreciation schedules.
Population Biology
Ecologists model population changes using recursive formulas. The logistic map, xₙ₊₁ = r · xₙ · (1 − xₙ), is one of the most studied examples. Here xₙ represents the population as a fraction of the environment’s carrying capacity, and r controls the growth rate. At low values of r, the population settles to a stable number. At higher values, the sequence oscillates between two or more values, and at very high values it becomes chaotic, producing wildly unpredictable population swings from one generation to the next.
Computer Science
Recursive sequences are the mathematical backbone of recursive algorithms in programming. A recursive function calls itself with a simpler version of the input, just as a recursive sequence defines each term using earlier, already-known terms. Every recursive function needs a base case (the equivalent of the initial value) that stops the chain of calls. Without it, the function calls itself forever and crashes. The base case has to return a sensible value on its own. For example, a function that computes the length of a list should return 0 when given an empty list. Each recursive call must also move closer to the base case, operating on a smaller number or a shorter list, so the process eventually terminates.
How to Work With Recursive Sequences
When you encounter a recursive sequence, start by identifying the two required pieces: the initial value(s) and the recurrence relation. Write out the first several terms by hand to get a feel for the pattern. If the sequence grows, note whether it grows by addition (arithmetic), by multiplication (geometric), or by some other rule.
If you need to find a term far down the sequence, check whether an explicit formula exists. For arithmetic sequences, the explicit form is aₙ = a₁ + (n−1)d, where d is the common difference. For geometric sequences, it’s aₙ = a₁ · rⁿ⁻¹, where r is the common ratio. For more complex recursive sequences, finding an explicit formula (sometimes called “solving” the recurrence relation) may require techniques from more advanced courses, or it may not be possible in a simple closed form at all.
If no explicit formula is available, computing terms iteratively is straightforward. Spreadsheets handle this naturally: put the initial value in the first cell, write the recurrence rule in the second cell referencing the first, and copy down. You’ll have hundreds of terms in seconds, which is far faster than working by hand and lets you spot convergence or divergence at a glance.