On this concept: Formula

Not sure which lesson to do first? Find your level and get a plan →

Math · Introduction to Calculus · Grade 9-12

Recursive vs Explicit Formulas

These are two ways to define the same sequence: recursive says 'from the previous term, do this,' while explicit gives an directly as a function of n.

Recursive: an=f(an−1,…) with initial condition(s). Explicit: an=g(n) directly.

Quick Answer

These are two ways to define the same sequence: recursive says 'from the previous term, do this,' while explicit gives an directly as a function of n. A recursive rule like a1=5, an=an−1+3 matches how many situations are described: each month adds $3, each generation doubles. An explicit rule like an=3n+2 answers "what is the 100th term?" in a single substitution. Converting from one form to the other is the main skill.

Why This Matters

Real processes are often stated step by step: a loan balance after each payment, a herd after each breeding season, a spreadsheet column where each cell uses the one above it. That is a recursive rule, easy to set up but slow to push far. The explicit form jumps straight to month 120, and it lets you solve for when a target is reached, which a recursive rule cannot do without computing every step on the way.

Intuitive Explanation

Picture a spreadsheet. In column A you type 5 in the first cell and "=A1+3" in the cell below, then fill down. Each cell looks at the one above it: that is a recursive rule, a1=5, an=an−1+3. In column B you type "=3*ROW()+2", and each cell computes its value from its own row number: that is an explicit rule, an=3n+2. Both columns show 5, 8, 11, 14.

Each form has a job. The recursive rule shows the mechanism, what happens from one step to the next, so it is the natural way to set up a problem. But it needs a starting value; without one, an=an−1+3 could describe 1, 4, 7 or 100, 103, 106. And it reaches a100 only after 99 steps, while the explicit rule gives a100=3(100)+2=302 at once.

For arithmetic and geometric sequences the conversion follows a pattern: adding d each time gives an=a1+(n−1)d, and multiplying by r gives an=a1rn−1. Other recursions are harder. The Fibonacci rule an=an−1+an−2 uses two previous terms, so it needs two starting values, and its explicit form (Binet's formula) involves 1+52, which no pattern-matching would find. A formula that contains only n, such as an=n2+1, is explicit even though it is neither arithmetic nor geometric.

Think of it like this. A recursive rule is a set of turn-by-turn directions, "from here, go 3 more blocks", which only work if you know where you are starting. An explicit rule is a street address: it takes you to house number 100 directly. Directions are easier to write down while making the journey; an address is faster for reaching somewhere far away.

Core idea. A recursive formula builds each term from the one before; an explicit formula jumps straight to the nth term from n.


When to Use

Use the recursive form when the problem describes each step from the last: "add 50 each month", "each year the herd grows by 10%", or a rule that mentions an−1. Use the explicit form when you need a far-off term or must solve for n, as in "when does the balance pass $1000?". Convert by recognising arithmetic (add d) or geometric (multiply by r) structure. If the question asks for the total of the terms, use a series or sigma notation instead.

Tip. Ask: Does the rule compute a term from the term(s) before it (recursive), or straight from the position n (explicit)?

How to Recognize It

Look at what the problem gives you, a starting value with a step rule or a formula in n, and at what it wants back.

  1. Is the answer you need a single term, rather than the total of several terms?

    Yes keeps you with sequence formulas. If the question wants a1+a2+⋯+a20, a running total or an amount saved overall, you need a series or sigma notation instead.

  2. Is the term you need far down the list, like a100, or must you solve for the position n?

    Yes means use the explicit form, so one substitution or one equation in n does the job. A no, such as listing the first five terms, means stepping through the recursive rule is quicker.

  3. Does each step add the same number or multiply by the same number?

    Adding d converts to an=a1+(n−1)d; multiplying by r gives an=a1rn−1. If the step itself changes, as in an=an−1+n, you find the explicit form by adding up the steps.

  4. Can the input be any real number, like x=2.5, rather than only the positions 1,2,3,…?

    If yes, you are working with function notation f(x), not a sequence, because a sequence has only whole-number positions. A rule like f(x)=3x+2 graphs as a line; an=3n+2 is a row of separate dots.

Recursive vs Explicit Formulas compared with Explicit formula, Function notation, and Series

Every row describes numbers produced by a rule, which is why they blur together. Separate them by asking whether you need one value or a total, and whether the input is a whole-number position or any real number.

Recursive vs Explicit Formulas

Meaning
Use this when you need to either generate a sequence term-by-term from a growth rule (recursive) or reach a distant term directly (explicit).
Key test
Does the rule compute a term from the term(s) before it (recursive), or straight from the position n (explicit)?
Formula
Recursive: an=f(an−1,…) with initial condition(s). Explicit: an=g(n) directly.
Example
A sequence is given recursively by a1=5, an=an−1+3. Find an explicit formula and use it to get a20.

Explicit formula

Meaning
Gives an directly from n, with no reference to earlier terms.
Key test
Use when you need a far term like a50 without computing the ones before it.
Formula
an=a1+(n−1)d
Example
a50=3+4(49)=199

Function notation

Meaning
Defines an output from an input over a continuous domain, not integer positions.
Key test
Use when the input can be any real number, not just 1,2,3,….
Formula
f(x)=4x−1
Example
f(2.5)=9

Series

Meaning
Adds the terms of a sequence rather than listing or generating them.
Key test
Use when the problem asks for a sum, not a single term.
Formula
∑an
Example
3+7+11+15

Formula & Notation

Recursive: an=f(an−1,…) with initial condition(s). Explicit: an=g(n) directly.
Recursive: an=f(an−1,…,an−k) with initial conditions a1,…,ak. Explicit (closed-form): an=g(n) where g:N→R. A closed form exists iff the recurrence can be solved: e.g., an=an−1+d,  a1=c  ⟹  an=c+(n−1)d.

How to read it: Recursive: an=an−1+d (arithmetic), an=r⋅an−1 (geometric). Explicit: an=a1+(n−1)d or an=a1⋅rn−1.

Worked Examples

Example 1 — Convert recursive to explicit

Easy

A sequence is given recursively by a1=5, an=an−1+3. Find an explicit formula and use it to get a20.
Show the steps and the answer
  1. Generate a few terms: 5, 8, 11, 14.

    Each term is 3 more than the one before, so the sequence is arithmetic with a1=5 and d=3.

  2. Write the explicit form: an=5+3(n−1)=3n+2.

    The nth term is the first term plus n−1 steps of 3.

  3. Check it against the recursion: a1=3(1)+2=5 and a4=3(4)+2=14.

    The explicit rule must reproduce the terms the recursion generated.

  4. Substitute n=20: a20=3(20)+2=62.

    One substitution replaces 19 rounds of adding 3.

Answer: a20=62

Takeaway: Recognise the step (add d or multiply by r), write the matching explicit form, and test it on the first few terms.

Example 2 — Two-term recursion

Standard

A sequence is a1=1, a2=1, an=an−1+an−2. Can you write a one-line explicit formula like an=a1+(n−1)d?
Show the steps and the answer
  1. Generate terms: 1, 1, 2, 3, 5, 8, 13.

    Each term needs the two before it, so the rule needs two starting values, a1 and a2.

  2. Test for arithmetic: the differences 0, 1, 1, 2, 3, 5 are not constant.

    With no fixed d, the form a1+(n−1)d cannot describe it.

  3. Test for geometric: the ratios 1, 2, 1.5, 1.67, 1.6, 1.625 are not constant.

    With no fixed r, the form a1rn−1 fails too, although the ratios settle near 1.618.

  4. Conclude: compute it term by term.

    An explicit formula does exist (Binet's formula, built from 1+52≈1.618), but it is nothing like the one-line arithmetic or geometric forms.

Answer: No simple explicit form — compute term by term: 1,1,2,3,5,8,…

Takeaway: Only some recursions convert neatly; a rule that uses two earlier terms is usually computed step by step.

Example 3 — Find the mistake: position or value?

Application

A sequence has a1=2 and an=an−1+4. Zoe writes: "a5=a5−1+4=4+4=8." Find the mistake and correct it.
Show the steps and the answer
  1. Read a5−1 correctly: it means a4, the value of the 4th term, not the number 4.

    Zoe replaced a term by its position, which treats the recursive rule as if it were explicit.

  2. Build up from the start: a1=2, a2=6, a3=10, a4=14, so a5=14+4=18.

    A recursive rule needs the actual previous value, so you start at a1 and step forward.

  3. Confirm with the explicit form: an=2+4(n−1)=4n−2, so a5=4(5)−2=18.

    Both forms agree, and Zoe's 8 does not appear anywhere in 2, 6, 10, 14, 18.

Answer: a5=18

Takeaway: In a recursive rule, an−1 is a term's value: find it by stepping forward from a1, or convert to an explicit rule first.

Where You'll See It

  • Paying off a loan month by month

    A $5,000 loan at 1% a month with $200 payments follows Bn=1.01Bn−1−200, the way a bank statement is built. The explicit form Bn=20000−15000(1.01)n reaches 0 when 1.01n=43, so n≈28.9: the 29th payment clears the loan, with no table needed.

  • Counting ways to climb stairs

    Climbing n stairs 1 or 2 at a time, your last move is a single or a double step, so the number of routes is Wn=Wn−1+Wn−2, with W1=1 and W2=2. The recursion gives W10=89 in a few lines, far faster than listing every route.

Common Mistakes

  1. The slip: Giving a recursive rule with no initial condition

    Instead: always state a1 (and a2 if the rule uses two prior terms).

  2. The slip: Using the recursive form to find a far term like a100

    Instead: convert to the explicit form first so you can substitute once.

  3. The slip: Plugging n into a recursive formula as if it were explicit

    Instead: an=an−1+4 needs the actual previous value, not n.


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. A sequence has a1=4 and an=2an−1−1. Find a2, a3, a4 and a5.

    Hint: Each new term uses the term just before it: double it, then subtract 1.

  2. A sequence has a1=10 and an=an−1−3. Write an explicit formula and use it to find a30.

    Hint: Each step subtracts 3, so this is arithmetic with d=−3.

  3. A sequence has a1=3 and an=2an−1. Write an explicit formula and find a10.

    Hint: Each step multiplies by 2. How many doublings take you from a1 to a10?

  4. Write a recursive formula, with its starting value, for the explicit sequence an=5n+2.

    Hint: Find a1, then work out how much each term adds to the one before it.

  5. You need the 200th term of the sequence a1=6, an=an−1+4. Keep using the recursive rule, or switch to an explicit formula?

    Hint: Count how many steps the recursive rule would need to reach the 200th term.

  6. For a1=9 and an=an−1+4, a student writes "a3=3+4=7." Correct the work.

    Hint: In a recursive rule, what goes in place of an−1: the position number or the previous term?

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

Can two different-looking formulas describe the same sequence?

Yes. The rules a1=5a_1=5, an=an−1+3a_n=a_{n-1}+3 and an=3n+2a_n=3n+2 produce exactly the same list 5, 8, 11, 14, and so does an=3(n−1)+5a_n=3(n-1)+5 once you expand it. To check that two rules match, compare a few terms and confirm that both use the same step. Two explicit formulas that agree for every positive integer nn are the same sequence, however they are written.

Why can't I be sure of the next term from the first three terms alone?

Finitely many terms never pin down a rule. The terms 1, 2, 4 fit doubling, an=2n−1a_n=2^{n-1}, which gives 8 next, but they also fit an=n2−n+22a_n=\frac{n^2-n+2}{2}, which gives 7 next. A problem must state the rule, or say the sequence is arithmetic or geometric, before the next term is guaranteed. When a test shows only terms, it expects the simplest common step.

Why do spreadsheets and computer programs so often use the recursive form?

A spreadsheet fills cell B2 from B1, B3 from B2, and so on, which is a recursive rule at work: each row needs only the row above. That suits situations where every step depends on what happened last, like a loan balance after interest and a monthly payment. The explicit form wins when you want row 500 without filling in the 499 rows before it.

Does every recursive rule have an explicit formula?

Arithmetic and geometric rules convert easily, and many others do with work: an=an−1+na_n=a_{n-1}+n with a1=1a_1=1 adds up to an=n(n+1)2a_n=\frac{n(n+1)}{2}. Fibonacci, where each term is the sum of the two before it, also has an explicit formula, but it involves 5\sqrt5 and is far from obvious. Some rules, such as the population model an=3.7 an−1(1−an−1)a_n=3.7\,a_{n-1}(1-a_{n-1}), have no known simple formula, so computers just step through them.

Learning Path

Recursive vs Explicit Formulas

You are here

You need Sequence, Arithmetic Sequence and Geometric Sequence: their rules an=a1+(n−1)d and an=a1rn−1 are the standard explicit forms. This concept adds the step-by-step recursive description and the skill of converting between the two. Next, Sigma Notation writes sums of these terms compactly, and Series asks what such sums add up to.

See Also