Sequences as
Functions & Recursion
Discover how sequences are functions with integer domains, and learn to define them using explicit and recursive formulas.
What Is a Sequence?
A sequence is an ordered list of numbers that follows a pattern. Each number is called a term, and we label them with their position: \( a_1, a_2, a_3, \dots \)
Sequences Are Functions
A sequence is really a function whose domain is a subset of the integers (usually \( \{1, 2, 3, \dots\} \) or \( \{0, 1, 2, \dots\} \)). The input is the term number \( n \), and the output is the term value \( f(n) \).
Why Does This Matter?
Treating sequences as functions lets you use all the tools of function analysis: notation, graphing, domain/range, and composition. It also unifies patterns you already know.
Explicit vs Recursive Formulas
There are two main ways to define a sequence as a function:
Example: \( a_n = 3n - 1 \)
Jump straight to any term.
Example: \( a_1 = 2,\; a_n = a_{n-1} + 3 \)
Build term by term.
The Recursive Definition
A recursive definition has two parts:
The Fibonacci Sequence
The Fibonacci sequence is the classic example of recursion that needs two base cases:
Each term is the sum of the two before it. The two base cases \( f_1 = 1 \) and \( f_2 = 1 \) are both needed to start the chain.
Sequence Domain vs Continuous Domain
A key distinction: a sequence's domain is discrete integers, not all real numbers. This means the graph is isolated dots, not a connected line.
How to Write a Recursive Formula
Example 1: Arithmetic Sequence
Define the sequence 4, 7, 10, 13, 16, ... both explicitly and recursively.
\( a_n = 4 + 3(n - 1) = 3n + 1 \)
Recurrence: \( a_n = a_{n-1} + 3 \)
Example 2: Geometric Sequence
Define the sequence 3, 6, 12, 24, 48, ... both explicitly and recursively.
\( a_n = 3 \cdot 2^{n-1} \)
Recurrence: \( a_n = 2 \cdot a_{n-1} \)
Example 3: Two-Term Recursion
Define the sequence: 1, 3, 4, 7, 11, 18, ...
Graphing a Sequence as a Function
Plot \( a_n = 3n + 1 \) on a coordinate plane. Each point is \( (n, a_n) \).
When to Use Explicit vs Recursive
| Explicit | Recursive | |
|---|---|---|
| Find the 100th term | Fast: plug in \( n = 100 \) | Slow: compute all 99 terms first |
| Ease of discovery | Requires spotting a closed-form pattern | Easy: just describe term-to-term change |
| Complex patterns | May not exist (e.g., Fibonacci) | Natural fit for multi-term rules |
| Computer programs | Great for direct lookup | Great for loops and iteration |
Common Mistakes
Question 1 of 5
What is the domain of a sequence when viewed as a function?
Question 2 of 5
Given \( a_1 = 5 \) and \( a_n = a_{n-1} + 4 \), what is \( a_4 \)?
Question 3 of 5
Which recursive definition correctly describes the sequence 2, 6, 18, 54, ...?
Question 4 of 5
The Fibonacci sequence is defined by \( f_1 = 1, \; f_2 = 1, \; f_n = f_{n-1} + f_{n-2} \) for \( n \geq 3 \). What is \( f_6 \)?
Question 5 of 5
If \( a_n = 4n - 3 \), what is the value of \( a_{20} \)?