Historical Context & Motivation
The study of sequences is one of the oldest pursuits in mathematics. Long before the language of functions was formalized, scholars across cultures noticed that many natural and numerical patterns could be described by simple rules — each term built from the previous one, or each term computed directly from its position. The tension between these two perspectives — recursive (step‐by‐step) and explicit (direct computation) — has shaped mathematics from antiquity to the present day.
The central question this lesson addresses is deceptively simple: What is a sequence, and how can we describe it precisely? By treating a sequence as a function — mapping each position number n to its corresponding term — we gain two complementary tools. The explicit formula lets us jump directly to any term, while the recursive formula shows us how the sequence builds upon itself, one step at a time.
Core Principles & Definitions
A sequence is an ordered list of numbers called terms. What makes a sequence different from a mere set is that order matters: the first term, the second term, the third term, and so on each have a definite position. Because every term is paired with exactly one position number, a sequence is, by definition, a function whose domain is a subset of the integers (usually {1, 2, 3, …} or {0, 1, 2, …}) and whose range is a subset of the real numbers.
Sequence as a Function
Explicit (Closed‑Form) Rule
Recursive Rule
Domain & Range
Visual Explanation
The diagram below shows how the arithmetic sequence an = 2n + 1 can be viewed as a function. The horizontal axis represents the term position n (the domain), while the vertical axis represents the value an (the range). Each point is an input‐output pair — just like any function you've graphed — except the points are discrete (no line connecting them) because the domain is the natural numbers.
Notice that the six discrete points lie along what would be a straight line — this is characteristic of an arithmetic sequence, whose explicit formula is linear. The curved violet arrows illustrate the recursive view: to find a5 = 11, you add 2 to the previous term a4 = 9. The vertical cyan arrow shows the explicit view: plug n = 5 directly into the formula an = 2n + 1 to get 11, bypassing all earlier terms.
Mathematical Framework — The Formulas
The two most important families of sequences in Algebra 2 are arithmetic sequences (constant difference between consecutive terms) and geometric sequences (constant ratio between consecutive terms). Each family can be described with both an explicit and a recursive formula.
Arithmetic Sequences
An arithmetic sequence has a common difference d. Starting from a first term a1, each subsequent term is obtained by adding d. Here are both representations:
This formula acts like a direct lookup: for any position n, you compute the value in one step. Notice its structure mirrors a linear function y = mx + b, where the slope corresponds to the common difference d.
The recursive version emphasizes the process of building the sequence. You must specify the initial condition a1 — without it, the recursion has no starting point and the sequence is undefined.
Geometric Sequences
A geometric sequence has a common ratio r. Each term is obtained by multiplying the previous term by r:
The explicit formula for a geometric sequence is exponential, not linear. This means geometric sequences grow (or decay) much faster than arithmetic ones — a crucial distinction in applications like compound interest, population growth, and radioactive decay.
Detailed Breakdown — Arithmetic vs. Geometric
Let's compare the two sequence types side by side: their rules, their graphs, and their behavior. The diagram below shows both an arithmetic and a geometric sequence starting from the same first term, making their different growth patterns visually obvious.
Both sequences begin at a1 = 2, but their trajectories diverge dramatically. The arithmetic sequence (d = 3) grows steadily — its points trace a straight line. The geometric sequence (r = 2) starts slowly but explodes upward — its points trace an exponential curve. By the sixth term, the geometric sequence has reached 64 while the arithmetic sequence is only at 17.
| Feature | Arithmetic Sequence | Geometric Sequence |
|---|---|---|
| Pattern | Add a constant d | Multiply by a constant r |
| Explicit formula | aₙ = a₁ + (n−1)d | aₙ = a₁ × r^(n−1) |
| Recursive formula | aₙ = aₙ₋₁ + d | aₙ = aₙ₋₁ × r |
| Graph shape | Linear (straight line of points) | Exponential (curved path of points) |
| Growth type | Constant (additive) | Multiplicative (compound) |
| Real-world example | Saving $50/month in a jar | Bacteria doubling every hour |
Worked Example
Let's work through a complete problem that asks us to move between recursive and explicit representations.
Strengths & Limitations — Recursive vs. Explicit
Both formula types describe the same sequence, but they have different practical strengths and weaknesses. Understanding when to use each is a key part of mathematical fluency.
| Criterion | Explicit Formula | Recursive Formula |
|---|---|---|
| Finding the nth term | Excellent — direct computation, O(1) | Slow — must compute all preceding terms, O(n) |
| Finding which term has value v | Excellent — set aₙ = v and solve | Difficult — iterate until you find it |
| Ease of discovery | Harder — requires recognizing pattern | Easier — often mirrors the verbal description |
| Modeling real processes | Less intuitive for step-by-step processes | Natural for processes defined by change rules |
| Computer implementation | Efficient, no memory of past terms needed | Simple to code but may be slow for large n |
| Existence | Not always possible (e.g., some recursive sequences have no closed form) | Always possible if the rule is defined |
Connections to Advanced Theory
The ideas you've learned here form the foundation for several powerful topics you'll encounter later in mathematics. Understanding sequences as functions opens doors to calculus, computer science, and mathematical analysis.
Series and summation. Once you can describe the nth term of a sequence, you can ask: "What happens if I add up all the terms?" This leads to series — the study of infinite sums. The explicit formula for a geometric sequence, for instance, leads directly to the geometric series formula S = a₁ / (1 − r) when |r| < 1, which has applications in physics, finance, and probability.
Recurrence relations. The recursive formulas you've studied are the simplest examples of recurrence relations, a vast area of discrete mathematics. More complex recurrences — like the Fibonacci relation aₙ = aₙ₋₁ + aₙ₋₂ — require techniques from linear algebra (characteristic equations, matrix methods) to solve for explicit formulas.
Limits and convergence. In calculus, you'll study what happens as n → ∞. Does the sequence approach a fixed value (converge) or grow without bound (diverge)? The arithmetic sequence with d ≠ 0 always diverges, while a geometric sequence converges to 0 precisely when |r| < 1.
| This Lesson | Advanced Extension |
|---|---|
| Arithmetic explicit formula | Linear functions, arithmetic series (Gauss's formula) |
| Geometric explicit formula | Exponential functions, infinite geometric series |
| Recursive definitions | Recurrence relations, dynamical systems, algorithms |
| Sequence as a function ℕ → ℝ | Limits of sequences, formal definition of continuity |
| Domain restricted to integers | Discrete vs. continuous modeling, sampling theory |
Practice Problems
Lesson Summary
A sequence is a function whose domain is the positive integers, mapping each position n to a term value an. Every sequence can be described in two complementary ways: an explicit (closed‑form) formula that computes any term directly from its position, and a recursive formula that builds each term from one or more previous terms plus an initial condition. For arithmetic sequences, the explicit formula is linear — an = a1 + (n − 1)d — reflecting constant additive growth, while the recursive rule simply adds the common difference d at each step. For geometric sequences, the explicit formula is exponential — an = a1 × rn−1 — reflecting multiplicative growth governed by the common ratio r.
The explicit formula excels at direct computation and solving for unknown positions, while the recursive formula excels at modeling step‑by‑step processes and is often easier to discover from a verbal description. Some sequences — like the Fibonacci sequence — have no simple explicit form, reminding us that the recursive perspective is sometimes the more fundamental one. Mastering the translation between recursive and explicit representations is a cornerstone skill that connects algebra to calculus, computer science, and mathematical modeling.