Recursive and Explicit Formulas- Sequences Explained

What Sequences Actually Are

A sequence is just a list of numbers in a specific order. That's it. You have a first term, a second term, a third term, and so on. Each term has a position: first, second, third, and the position number tells you which term you're looking at.

Sequences show up everywhere. Compound interest, population growth, the bounce height of a ball—these are all sequences. The question is: how do you find any term you want without listing every single one?

That's where formulas come in. You need a way to calculate any term based on its position. There are two main ways to do this: explicit formulas and recursive formulas. Each works differently.

Explicit Formulas: Find Any Term Directly

An explicit formula gives you the nth term directly. You plug in the position number n, and you get the term's value. No other information required.

Think of it like a vending machine. You press the button for item number 7, and you get item 7 immediately. You don't need items 1 through 6 first.

The General Form

Explicit formulas typically look like:

a_n = expression in terms of n

Where a_n means "the nth term" and n is the position in the sequence.

Common Explicit Formulas

Arithmetic sequence: a_n = a₁ + (n-1)d
Geometric sequence: a_n = a₁ · r^n-1
Square numbers: a_n = n²

Example: Finding the 50th Term

Say you have the sequence 3, 7, 11, 15, 19... This is arithmetic with a first term of 3 and a common difference of 4.

Your explicit formula is: a_n = 3 + (n-1) · 4

To find the 50th term: a₅₀ = 3 + (50-1) · 4 = 3 + 196 = 199

One calculation. Done. That's the power of explicit formulas.

Recursive Formulas: Build From What Came Before

A recursive formula tells you how to get from one term to the next. You need the previous term(s) to find the current term. It's like a domino chain—each domino knocks over the next one.

Recursive formulas always need a starting point. Without that, you have nothing to build from.

The General Form

Recursive formulas look like:

a₁ = starting value
a_n = relationship using previous terms

Example: Same Sequence, Different Approach

For 3, 7, 11, 15, 19... the recursive formula is:

a₁ = 3
a_n = a_n-1 + 4

To find the 50th term, you'd need to calculate terms 1 through 49 first. That's 49 calculations just to get to the one you want. Slow.

Why Recursive Formulas Exist

They model how things actually change in real life. A population doesn't know the population size 100 years from now—it grows based on the current population. Recursive formulas capture that dependency.

Explicit vs Recursive: The Direct Comparison

Feature	Explicit Formula	Recursive Formula
How it works	Calculate any term directly from n	Calculate each term from previous terms
Starting point	Not required (just plug in n)	Required (a₁ or base case)
Finding term n	One calculation	n-1 calculations
Best for	Quick answers to "what is term X?"	Modeling processes that build on themselves
Computer efficiency	O(1) per term	O(n) to find term n

Converting Between the Two

Sometimes you have one type and need the other. Here's how to swap them.

Explicit to Recursive

Take a_n = 3 + (n-1) · 4

You can see the pattern: each term adds 4 to the previous one. So:

a₁ = 3
a_n = a_n-1 + 4

Recursive to Explicit

Take a₁ = 3, a_n = a_n-1 + 4

Expand it out:

a₂ = a₁ + 4 = 3 + 4
a₃ = a₂ + 4 = (3 + 4) + 4 = 3 + 2·4
a₄ = a₃ + 4 = (3 + 2·4) + 4 = 3 + 3·4

Pattern emerges: a_n = 3 + (n-1) · 4

For geometric sequences, the conversion uses exponents instead: a_n = a₁ · r^n-1

How to Write Formulas: Getting Started

Here's the practical process for both types.

Writing an Explicit Formula

Identify the pattern. Look at how each term relates to its position number.
Check if it's arithmetic (constant addition) or geometric (constant multiplication).
Find the first term a₁.
Find the common difference d or common ratio r.
Plug into the standard formula and simplify.

Example: Sequence 2, 6, 18, 54...

Pattern: each term is 3 times the previous one
Geometric with r = 3
a₁ = 2
Formula: a_n = 2 · 3^n-1

Writing a Recursive Formula

Identify what operation connects each term to the previous one.
Set the first term as your base case.
Express a_n in terms of a_n-1.

Example: Sequence 100, 90, 80, 70...

Pattern: subtract 10 each time
Base case: a₁ = 100
Formula: a_n = a_n-1 - 10

Common Mistakes to Avoid

Forgetting the base case in recursive formulas. Without it, you can't start the sequence.
Confusing n-1 with n in explicit formulas. In a_n = a₁ + (n-1)d, the n-1 is correct for arithmetic sequences starting at a₁.
Using the wrong index. Some sequences start at n = 0. Adjust your formula accordingly.
Overcomplicating simple patterns. If it's adding 5 each time, just say that. Don't invent complex operations when simple ones work.

Which Formula Type Should You Use?

Use explicit when you need fast answers. If someone asks "what's the 1000th term?", explicit gets you there in one step.

Use recursive when you're modeling real-world processes or when the pattern naturally builds on itself. Fibonacci sequences, loan amortization, viral spread—these are recursive by nature.

Sometimes you'll need both. A recursive definition might be easier to derive, but an explicit formula is what you use to actually compute values. Know when to convert.

That's the core of it. Explicit gives you direct access. Recursive builds step by step. Pick the right tool for what you're actually trying to do.