Recursive Formula

Definitionnoun phrase

What is a recursive formula?

A recursive formula defines a sequence by giving its first term and a rule that builds each next term from the term or terms before it. For example, a1 = 5 and an = an − 1 + 4 make 5, 9, 13, 17. To find a later term, you compute every term before it, one step at a time.

In Spanish
fórmula recursiva
Also called
recursive rule, recursive definition, recurrence relation, recursive sequence
Grade level
Algebra 1
Algebra 1Algebra 2CCSS HSF-BF.A.2CCSS HSF-IF.A.3SATACTACCUPLACERPSAT

Recursive Formula in a picture

Three sequences given by recursive formulasRow 1: start at 5 and add 4: 5, 9, 13, 17. Row 2: start at 3 and double: 3, 6, 12, 24. Row 3: the Fibonacci sequence, start with 1 and 1, then add the two previous terms: 1, 1, 2, 3, 5.a₁ = 5, aₙ = aₙ₋₁ + 45+4a₁9+4a₂13+4a₃17a₄a₁ = 3, aₙ = 2 · aₙ₋₁3×2a₁6×2a₂12×2a₃24a₄a₁ = a₂ = 1, aₙ = aₙ₋₁ + aₙ₋₂1a₁1a₂2a₃3a₄5a₅Each term is built from the term(s) before it.
In each row you need the earlier terms to make the next one: add 4, double, or add the previous two (the Fibonacci sequence).

Formal definition and notation

A recursive formula for a sequence consists of one or more initial terms, such as a1, together with a recurrence relation that expresses an in terms of earlier terms, such as an = f(an − 1) for n ≥ 2. Arithmetic sequences satisfy an = an − 1 + d and geometric sequences satisfy an = r · an − 1. The Fibonacci sequence uses two previous terms: an = an − 1 + an − 2 with a1 = a2 = 1.

Symbol Read it as Meaning
an a sub n the nth term
an − 1 a sub n minus 1 the term just before an
a1 = 5 a sub 1 equals 5 the starting value (initial condition)
f(n) = f(n − 1) + 4 f of n equals f of n minus 1, plus 4 the same rule in function notation

Key facts

  • A recursive formula always has two parts: a starting term and a rule. Without the start, the sequence is not determined.
  • To get a10 recursively you need a9, which needs a8, and so on: it is slow for far-away terms.
  • An explicit formula computes an directly from n; a recursive one computes it from earlier terms.
  • Some sequences are easiest to describe recursively, such as Fibonacci: 1, 1, 2, 3, 5, 8, 13.
  • Spreadsheets and computer loops work recursively: each cell or step uses the one before it.
  • Sequences are functions on the counting numbers, so f(n) = f(n − 1) + 4 is the same idea in function notation.

Common recursive formulas

Common recursive formulas
an = an − 1 + d or an = r · an − 1
a1
the first term, which must be given
d
the common difference of an arithmetic sequence
r
the common ratio of a geometric sequence

The matching explicit formulas are an = a1 + (n − 1)d and an = a1rn − 1, which jump straight to any term.

Try it: next term = 2 × previous + 1

Interactive

The machine applies the rule an = 2an − 1 + 1. Starting from a1 = 1, it has made 3, 7 and 15. Type the last output back in to make the next term; this is exactly how a recursive formula works.

This interactive needs JavaScript. The worked examples below show the same ideas step by step.

Recursive Formula examples, step by step

Example 1: List the terms

Warm-up

Write the first four terms of a1 = 7, an = an − 1 − 3.

  1. a1 = 7.
  2. a2 = 7 − 3 = 4, a3 = 4 − 3 = 1.
  3. a4 = 1 − 3 = −2.

Answer: The first four terms are 7, 4, 1, -2.

Example 2: Neither arithmetic nor geometric

Core

Find a4 for a1 = 2, an = 3an − 1 + 1.

  1. a2 = 3(2) + 1 = 7.
  2. a3 = 3(7) + 1 = 22.
  3. a4 = 3(22) + 1 = 67.

Answer: The fourth term is 67.

Example 3: From recursive to explicit

Test-style

A sequence has a1 = 10 and an = an − 1 + 6. Write an explicit formula and find a50.

  1. Adding 6 each time means arithmetic with d = 6.
  2. Explicit form: an = 10 + (n − 1) · 6 = 6n + 4.
  3. a50 = 6(50) + 4 = 304, with no need to list 49 earlier terms.

Answer: an = 6n + 4, so the 50th term is 304.

Common mistakes

✗ MistakeWriting only an = an − 1 + 4.
✓ Insteada1 = 5, an = an − 1 + 4.

The rule alone fits 5, 9, 13 and also 2, 6, 10. The first term pins down which sequence you mean.

✗ MistakeFor an = 2an − 1 with a1 = 3: a5 = 2 · 5 = 10.
✓ Instead3, 6, 12, 24, 48, so a5 = 48.

n is the position, not the input to the rule. The rule uses the previous term, so build up one term at a time.

✗ MistakeUsing an = an − 1 + 3 for 2, 6, 18, 54.
✓ Insteada1 = 2, an = 3an − 1.

Check differences and ratios. The differences 4, 12, 36 are not constant, but the ratio is always 3.

Not to be confused with

Recursive Formulavs.Explicit formula

An explicit formula gives an directly from n: an = 4n + 1 gives a100 = 401 at once. A recursive formula gives an from the previous term, so you must step through all the terms before it.

Recursive Formulavs.Common difference

The common difference is a number, such as 4. The recursive formula is a rule that uses it: an = an − 1 + 4.

Quick check: 3 questions

Question 1 of 3

Which recursive formula gives 4, 12, 36, 108, …?

Show answer and explanation

Answer: B. Each term is 3 times the one before, starting at 4. Adding 8 works only for the first step, the third choice swaps start and ratio, and the last is an explicit formula (and gives 12 for n = 1).

Question 2 of 3

If a1 = 2 and an = (an − 1)2, what is a3?

Show answer and explanation

Answer: C. a2 = 22 = 4 and a3 = 42 = 16. 4 stops at a2, 8 is 23, and 9 squares the position 3.

Question 3 of 3

The sequence 1, 1, 2, 3, 5, 8 continues by the rule an = an − 1 + an − 2. What is the next term?

Show answer and explanation

Answer: D. Add the two previous terms: 5 + 8 = 13. 16 doubles 8, 11 adds 3 to 8, and 10 adds 2.

Recursive Formula: frequently asked questions

What is the difference between a recursive and an explicit formula?

A recursive formula tells you how to get from one term to the next, such as an = an − 1 + 5 with a1 = 2. An explicit formula tells you any term from its position, such as an = 5n − 3. Both describe 2, 7, 12, 17, but only the explicit formula finds a200 in one step.

How do you write a recursive formula for a sequence?

First, give the first term. Then find how each term relates to the one before it: a constant difference means an = an − 1 + d, and a constant ratio means an = r · an − 1. For 50, 45, 40, the recursive formula is a1 = 50, an = an − 1 − 5.

Why do recursive formulas need a starting value?

The rule only says how to move from one term to the next; it does not say where to begin. The rule “add 3” could produce 1, 4, 7 or 10, 13, 16. Giving a1 fixes the first term, and then every later term follows. Rules that use two earlier terms, like Fibonacci, need two starting values.

Practice and tools

Sources

  1. Common Core State Standards, High School Functions, Building Functions (HSF-BF.A.2)
  2. Common Core State Standards, High School Functions, Interpreting Functions (HSF-IF.A.3)
  3. OpenStax, College Algebra 2e, 9.1 Sequences and Their Notations

Updated November 2026·Reviewed by the Effortless Math team·Standards: CCSS HSF-BF.A.2, CCSS HSF-IF.A.3

Cite this entry

Effortless Math Team. “Recursive Formula.” Effortless Math Dictionary. Updated November 2026. https://www.effortlessmath.com/math-dictionary/recursive-formula/

Flashcard

TermRecursive Formulaan = an − 1 + d
DefinitionA first term plus a rule that makes each term from the one before. a1 = 5, an = an − 1 + 4 gives 5, 9, 13, 17.
Study the full deck

Browse all terms in the Math Dictionary · More functions terms · Random term