4.4
2,100+ reviews on G2
A recursive equation (or recursive formula) defines each term of a sequence from the term before it, together with a starting term. It always has two parts:

Such as a₁ = 5.
How to get aₙ from aₙ₋₁.
aₙ = aₙ₋₁ + d.
aₙ = r · aₙ₋₁.
Do your homework in Evernote. The AI Assistant explains any problem you photograph, step by step.
Write them in order so you can compare neighbors: 5, 8, 11, 14, ...
Subtract each term from the next. If the result is always the same, d, the sequence is arithmetic.
Divide each term by the one before it. If the result is always r, the sequence is geometric.
a₁ = first term, then aₙ = aₙ₋₁ + d (arithmetic) or aₙ = r · aₙ₋₁ (geometric), for n ≥ 2.
Generate the next terms from your formula and compare them with the sequence.
Write a recursive formula for 5, 8, 11, 14, ... and find the 6th term.
a₁ = 5, aₙ = aₙ₋₁ + 3; the 6th term is 20
The explicit formula gives any term directly: aₙ = 5 + 3(n − 1) = 3n + 2, so a₆ = 3(6) + 2 = 20.
A recursive formula steps from term to term. An explicit formula jumps straight to the nth term.
| Sequence | Recursive | Explicit |
|---|---|---|
| Arithmetic: 5, 8, 11, 14 | a₁ = 5; aₙ = aₙ₋₁ + 3 | aₙ = 5 + 3(n − 1) |
| Geometric: 3, 6, 12, 24 | a₁ = 3; aₙ = 2aₙ₋₁ | aₙ = 3 · 2ⁿ⁻¹ |
| Decreasing: 40, 34, 28 | a₁ = 40; aₙ = aₙ₋₁ − 6 | aₙ = 40 − 6(n − 1) |
| Fibonacci: 1, 1, 2, 3, 5 | a₁ = 1, a₂ = 1; aₙ = aₙ₋₁ + aₙ₋₂ | Not a simple formula at this level |
OpenStax Algebra 1, sections 4.17 and 4.18 (recursive definitions, interchanging between formulas), and Calculus Volume 2, section 5.1 "Sequences".
4.4
2,100+ reviews on G2
4.4
8,200+ reviews on Capterra
4.4
73,000+ reviews on App Store
248M
Registered users
A rule that gives each term of a sequence from the term or terms before it, plus the starting term or terms.
The rule only says how to get from one term to the next. Without a starting value, many different sequences follow the same rule.
Find the common ratio r by dividing a term by the one before it. Then a₁ = first term and aₙ = r · aₙ₋₁. For 3, 6, 12, 24: a₁ = 3, aₙ = 2aₙ₋₁.
For arithmetic sequences, aₙ = a₁ + (n − 1)d. For geometric sequences, aₙ = a₁ · rⁿ⁻¹.
The term just before aₙ. If aₙ is the 5th term, aₙ₋₁ is the 4th.
Yes. The Fibonacci sequence uses the two previous terms: aₙ = aₙ₋₁ + aₙ₋₂, with a₁ = 1 and a₂ = 1.
Keep a Math notebook with your algebra formula sheet and a note for each problem you photograph.
Ask the AI Assistant to add the recursive formula for an arithmetic sequence to your algebra formula sheet, with one worked example. It writes the formula in a formula block, so it reads like the textbook.
Add a photo of your algebra problem, such as the sequence 5, 8, 11, 14, and ask the Assistant to explain it step by step. It reads the photo and adds the steps under it.
Ask the Assistant for a repeating practice task, such as 10 recursive formula problems every Tuesday and Thursday until the test. You get a reminder each time.
Build a formula sheet, photograph a problem for a step-by-step explanation, and practice on a schedule before the test.
Start for free