Why do I need to know a_1 if the formula tells me how to find each term?

The recursive formula a_n = f(a_{n-1}) only explains the relationship between consecutive terms; it is like a set of directions with no starting point. a_1 is the starting point. Without it, you would not know whether the sequence is 1, 2, 4, 8, \ldots or 5, 10, 20, 40, \ldots—both follow the same doubling rule but begin differently.

Can I use a recursive formula to find a_{1000} without calculating all the terms in between?

Not directly. Recursive formulas require you to calculate each term in sequence because each one depends on the previous one. For large n, you would need a computer to do the repeated calculations, or you would need to find a closed-form formula (an explicit formula for a_n that does not use previous terms) if one exists.

What is the difference between a recursive formula and a closed-form formula?

A recursive formula defines each term using the previous term(s), like a_n = 2a_{n-1} + 1. A closed-form formula gives you a_n directly without referencing other terms, like a_n = 3 \cdot 2^n - 1. Closed-form formulas are faster to use but harder to spot; recursive formulas are easier to set up from a real-world situation but require step-by-step calculation.

What if the problem gives me a_1 and a_2 as initial conditions?

Some sequences, especially those defined by more complex recursions, require two starting values to get going. For example, the Fibonacci sequence a_n = a_{n-1} + a_{n-2} needs both a_1 and a_2 because each term depends on the two previous ones. Use both initial values and apply the formula starting from a_3.

Recursive Formula

A recursive formula defines each term using the previous one, helping you find patterns and generate sequences step-by-step.

a_n = f(a_{n-1}), \quad a_1 \text{ given}

Solve a problem with Recursive Formula

Type the problem. The solver will use Recursive Formula where Recursive Formula is the right tool, and tell you when it is not.

What each symbol means

What Recursive Formula takes

Symbol	Meaning
$a_n$	The $n$ -th term of the sequence—the term you want to find at position $n$ .
$a_1$	The first term, given as the starting point; without this, you would not know where the sequence begins.
$f$	The function that defines the relationship, telling you how to calculate the next term from the current one.
$n$	The position or index in the sequence, indicating which term you are looking for; $n$ must be a positive integer.

When to use it

When you know how each term relates to the one before it and want to build a sequence step by step.

Level

Usually taught in: Algebra II

Worked examples

1. Find the first four terms with a simple linear rule

Problem

Find the first 4 terms of the sequence defined by

a_n = 2a_{n-1} + 1

with

a_1 = 3

$a_1 = 3$
Start with the given initial term.
$a_2 = 2a_1 + 1 = 2(3) + 1 = 7$
Apply the recursion formula with $n = 2$ : substitute $a_1 = 3$ into $a_n = 2a_{n-1} + 1$ .
$a_3 = 2a_2 + 1 = 2(7) + 1 = 15$
Apply the formula with $n = 3$ : substitute $a_2 = 7$ into the recursion.
$a_4 = 2a_3 + 1 = 2(15) + 1 = 31$
Apply the formula with $n = 4$ : substitute $a_3 = 15$ into the recursion.

Answer: $a_1 = 3, \quad a_2 = 7, \quad a_3 = 15, \quad a_4 = 31$

A recursive formula works like a chain: each new term depends only on the previous one. We start with $a_1 = 3$ and apply the rule $a_n = 2a_{n-1} + 1$ four times. This is the only way to find the sequence—you cannot jump to $a_4$ without computing $a_2$ and $a_3$ first.

2. Work with fractions and negative values

Problem

Find the first 4 terms of

a_n = \frac{1}{2}a_{n-1} - 2

with

a_1 = 8

$a_1 = 8$
Start with the given initial term.
$a_2 = \frac{1}{2}a_1 - 2 = \frac{1}{2}(8) - 2 = 4 - 2 = 2$
Substitute $a_1 = 8$ into $a_n = \frac{1}{2}a_{n-1} - 2$ .
$a_3 = \frac{1}{2}a_2 - 2 = \frac{1}{2}(2) - 2 = 1 - 2 = -1$
Substitute $a_2 = 2$ into the recursion; the result is negative because we subtracted more than we started with.
$a_4 = \frac{1}{2}a_3 - 2 = \frac{1}{2}(-1) - 2 = -\frac{1}{2} - 2 = -\frac{5}{2}$
Substitute $a_3 = -1$ into the recursion; negative values propagate through the sequence.

Answer: $a_1 = 8, \quad a_2 = 2, \quad a_3 = -1, \quad a_4 = -\frac{5}{2}$

Recursive formulas work even when the sequence becomes negative or involves fractions. Each term is still calculated from the previous one, following the same rule. The key is to do each calculation carefully, especially when fractions and negative signs are involved.

3. Calculate compound growth in a savings account

Problem

You deposit $1000 in a savings account that earns 5% interest each year. Write a recursive formula for the balance

a_n

after

n

years, and find the balance after 3 years.

$a_n = a_{n-1} + 0.05 \cdot a_{n-1} = 1.05 \cdot a_{n-1}$
Each year, the new balance is the old balance plus 5% of the old balance, which simplifies to multiplying by 1.05.
$a_0 = 1000$
The initial deposit (at year 0) is $1000. We use $a_0$ as the starting value because we measure time in years elapsed.
$a_1 = 1.05 \cdot a_0 = 1.05 \cdot 1000 = 1050$
After 1 year, the balance grows by 5%; you earn $50 in interest.
$a_2 = 1.05 \cdot a_1 = 1.05 \cdot 1050 = 1102.50$
After 2 years, apply the formula to $a_1$ ; you earn $52.50 in interest on the new balance.
$a_3 = 1.05 \cdot a_2 = 1.05 \cdot 1102.50 = 1157.625$
After 3 years, apply the formula to $a_2$ ; you earn $55.13 in interest.

Answer: $a_n = 1.05 \cdot a_{n-1} \text{ with } a_0 = 1000; \quad a_3 = \$1157.63$

Recursive formulas shine in real-world situations like compound interest, where growth depends on the current amount. This recursive setup naturally captures the idea that interest is earned on interest. You must calculate each year in sequence because the interest earned in year 2 depends on the balance at the end of year 1.

Common mistakes

Where Recursive Formula usually goes wrong

The mistake	Why it is wrong	The fix
Writing $a_n = f(a_n)$ instead of $a_n = f(a_{n-1})$ —using the same subscript on both sides.	This is circular: $a_n$ cannot depend on itself; it must depend on the previous term $a_{n-1}$ , otherwise you have no way to calculate new values.	Always use $a_{n-1}$ on the right side of a recursive formula. The subscript should decrease by 1 to indicate the term before the one you are finding.
Forgetting to use or find $a_1$ before calculating the rest of the sequence.	The recursive formula $a_n = f(a_{n-1})$ only tells you how to go from one term to the next; it does not tell you where to start. Without $a_1$ , you cannot compute $a_2$ .	Always identify and use the initial condition $a_1$ (or $a_0$ if the indexing starts there). This is the foundation of the entire sequence.
Treating the recursive formula as if you can jump directly to $a_{100}$ without calculating $a_2, a_3, \ldots, a_{99}$ in between.	Recursive formulas are inherently sequential—each term builds on the previous one. There is no shortcut; you must do the steps in order.	To find $a_n$ , calculate every term from $a_1$ up to $a_n$ in sequence. For large $n$ , use a calculator, computer, or look for a closed-form formula if one exists.

Tips and when to use something else

Always identify $a_1$ (or the given initial term) first—it is the seed of the entire sequence and the only place you start without using the formula.
Write out the first 2–3 terms by hand to verify your recursive formula is correct before calculating further.
If you need a shortcut for large $n$ , look for a closed-form (explicit) formula that does not depend on previous terms; many recursive sequences like arithmetic and geometric sequences have them.
Recursive formulas are perfect for modeling real-world growth, decay, and iteration—savings accounts, population dynamics, and computer algorithms often use them.

Related formulas

Arithmetic SequenceFind the nth term in a sequence with constant differences between consecutive terms, or determine how many steps it takes to reach a specific value.Geometric SequenceThe formula a_n = a_1 r^{n-1} finds any term in a geometric sequence, where each term is a constant multiple of the previous one.Fibonacci SequenceThe Fibonacci sequence is a series where each term equals the sum of the previous two terms; it models growth patterns found in nature.Sigma NotationSigma notation compresses long sums into a compact formula, letting you write and calculate the sum of many terms efficiently and accurately.Compound InterestCompound Interest calculates how money grows when interest earns interest, used for investments, savings, and loans over time.

Frequently asked questions

Why do I need to know $a_1$ if the formula tells me how to find each term?: The recursive formula $a_n = f(a_{n-1})$ only explains the relationship between consecutive terms; it is like a set of directions with no starting point. $a_1$ is the starting point. Without it, you would not know whether the sequence is $1, 2, 4, 8, \ldots$ or $5, 10, 20, 40, \ldots$ —both follow the same doubling rule but begin differently.
Can I use a recursive formula to find $a_{1000}$ without calculating all the terms in between?: Not directly. Recursive formulas require you to calculate each term in sequence because each one depends on the previous one. For large $n$ , you would need a computer to do the repeated calculations, or you would need to find a closed-form formula (an explicit formula for $a_n$ that does not use previous terms) if one exists.
What is the difference between a recursive formula and a closed-form formula?: A recursive formula defines each term using the previous term(s), like $a_n = 2a_{n-1} + 1$ . A closed-form formula gives you $a_n$ directly without referencing other terms, like $a_n = 3 \cdot 2^n - 1$ . Closed-form formulas are faster to use but harder to spot; recursive formulas are easier to set up from a real-world situation but require step-by-step calculation.
What if the problem gives me $a_1$ and $a_2$ as initial conditions?: Some sequences, especially those defined by more complex recursions, require two starting values to get going. For example, the Fibonacci sequence $a_n = a_{n-1} + a_{n-2}$ needs both $a_1$ and $a_2$ because each term depends on the two previous ones. Use both initial values and apply the formula starting from $a_3$ .

Need a different method?

The full solver is not scoped to one formula — type any problem and it will pick the method.

Open the math solver

Reviewed 2026-09-18