Recursive Formula Explained: Definition, Examples, and How to Use It

If you have ever counted up by adding the same number again and again, you already understand the heart of a recursive formula. A recursive formula is a rule that tells you how to get the next term in a sequence from the term or terms that came before it. It always has two parts: a starting value (or values) and a rule that links each term to its predecessor.

This guide walks through what a recursive formula is, the three most common types you will meet in school, a full worked example, and how recursion compares to an explicit formula that jumps straight to any term. By the end you will be able to read, write, and use recursive formulas with confidence.

What is a recursive formula?

A recursive formula is a two-part definition of a sequence. The first part is the base case, the known starting value such as a_1. The second part is the recursive rule, an equation that expresses a general term a_n in terms of one or more earlier terms like a_(n-1) or a_(n-2).

The word recursive comes from the idea of a rule that refers back to itself. To find any term you must first know the term before it, which means you generally build the sequence one step at a time from the beginning. Without a base case the rule has nothing to start from, so the base case is not optional. It is what makes the whole sequence well defined.

• Base case: the starting term or terms, for example a_1 = 3.
• Recursive rule: how to build the next term, for example a_n = a_(n-1) + 5.
• Order matters: you find a_2 from a_1, then a_3 from a_2, and so on.

The three classic recursive formulas

Most recursive sequences you study fall into three families. Each one keeps the same two-part shape but changes the rule that links one term to the next.

Arithmetic sequences

In an arithmetic sequence you add the same fixed amount, called the common difference d, every step. The recursive formula is a_n = a_(n-1) + d, with a_1 given. If a_1 = 2 and d = 4, the sequence runs 2, 6, 10, 14, and so on. For a deeper look at this family, see our arithmetic sequence formula guide.

Geometric sequences

In a geometric sequence you multiply by the same fixed factor, called the common ratio r, every step. The recursive formula is *a_n = a_(n-1) r**, with a_1 given. If a_1 = 3 and r = 2, the sequence runs 3, 6, 12, 24, and so on. This is the same pattern behind exponential growth and compound interest. The full breakdown lives in our geometric sequence formula guide.

The Fibonacci sequence

The Fibonacci sequence needs two earlier terms, not one. Its recursive formula is a_n = a_(n-1) + a_(n-2), with a_1 = a_2 = 1. Each term is the sum of the two before it, giving 1, 1, 2, 3, 5, 8, 13, 21, and so on. Because it depends on two predecessors, it needs two starting values rather than one.

How to use a recursive formula: a worked example

Suppose you are given the arithmetic recursive formula a_n = a_(n-1) + 5 with a base case of a_1 = 3, and you want the first five terms. Work term by term from the start.

1. Write down the base case. a_1 = 3.
2. Apply the rule for n = 2. a_2 = a_1 + 5 = 3 + 5 = 8.
3. Apply the rule for n = 3. a_3 = a_2 + 5 = 8 + 5 = 13.
4. Apply the rule for n = 4. a_4 = a_3 + 5 = 13 + 5 = 18.
5. Apply the rule for n = 5. a_5 = a_4 + 5 = 18 + 5 = 23.
6. Read off the sequence. The first five terms are 3, 8, 13, 18, 23.

Notice that to reach a_5 you had to pass through every term before it. That is the defining feature of recursion: there are no shortcuts, you climb the ladder one rung at a time. The same step by step style appears when you study an average rate of change across the points of a sequence.

Recursive vs explicit (closed-form) formulas

A recursive formula contrasts with an explicit formula, also called a closed-form formula, which gives a_n directly from n without needing any earlier term. For the arithmetic example above, the explicit formula is a_n = 3 + 5(n - 1), so you can find a_100 in one calculation instead of computing ninety-nine terms first.

Both describe the same sequence, but they answer different questions. Use recursion when the relationship between neighbouring terms is the natural idea, such as adding interest each month. Use the explicit form when you want one specific far-off term quickly.

Where recursive formulas show up

Recursion is not just a textbook exercise. It models any process where each state grows out of the one before it.

• Finance: a savings balance that earns interest each period follows a geometric recursion, the foundation of compound interest.
• Biology and nature: population models and the famous spiral patterns linked to the Fibonacci sequence.
• Computer science: algorithms that call themselves, such as sorting and tree traversal, are built on recursion.
• Everyday math: loan repayments, depreciation schedules, and any running total that updates one step at a time.

Common mistakes to avoid

• Forgetting the base case. A rule like a_n = a_(n-1) + 5 means nothing until you state a_1. Without it the sequence cannot start.
• Mixing up the index. a_(n-1) is the term right before a_n, not the value n minus 1. Read it as a position, not a number.
• Giving too few starting values. Fibonacci-style rules that reach back two terms need two base cases, a_1 and a_2, not just one.
• Confusing recursive and explicit forms. a_n = a_(n-1) + d is recursive; a_n = a_1 + (n - 1)d is explicit. Do not blend the two in one expression.
• Skipping terms. You cannot jump straight to a_n with a recursive rule. You must build every term in order up to it.

Good to know

Many sequences can be written both ways. If a recursive rule adds a constant, it is arithmetic and has a tidy explicit form. If it multiplies by a constant, it is geometric. When the rule depends on two earlier terms, like Fibonacci, an explicit form still exists but it is far less obvious. Knowing both the slope-style constant-change view and the multiplying view helps you recognise which family a sequence belongs to at a glance.