Sequences as Functions

⚡ Key Takeaways

A sequence is a function whose domain is a set of consecutive integers (usually the positive integers or natural numbers). The output for input $n$ is called the $n$ -th term, written $a_n$ instead of $a(n)$ . Reframing sequences as functions unlocks tools from algebra and calculus — graphs, growth rates, limits, and transformations. Foundational topic in precalculus, calculus, and discrete mathematics; formalized through the 17th–19th century development of functions and limits.

💡 The Core Insight

A sequence is not just a list — it is a rule of assignment from a discrete domain to a codomain. Writing $a_n$ instead of $a(n)$ is pure notation: the index $n$ is the input, and $a_n$ is the output. Because the domain is discrete (separated integers, not a continuous interval), the graph of a sequence is a set of isolated points, never a connected curve. Everything about functions — composition, inverses, transformations, growth comparison, and limiting behavior — transfers directly to sequences, with the single restriction that we only ever evaluate at integers.

DefinitionSequence as a Function

A sequence of real numbers is a function

1

\quad a : \mathbb{N} \to \mathbb{R}, \qquad n \mapsto a_n

Derivation hint: This is simply the definition of a function whose domain is restricted to $\mathbb{N} = \{1, 2, 3, \dots\}$ (some authors start at $0$ ). Here:

$n$ is the index (or position), an element of the domain $\mathbb{N}$ .
$a_n$ is the $n$ -th term, the function's output, an element of the codomain $\mathbb{R}$ .
The whole sequence is denoted $(a_n)_{n=1}^{\infty}$ or $(a_n)$ .
The range $\{a_n : n \in \mathbb{N}\}$ is a set; the sequence is an ordered object, so order and repetition matter even though they do not in the range.

A sequence may be specified in three equivalent ways:

2

\quad \text{Explicit (closed form):}\quad a_n = f(n)

Derivation hint: Direct functional rule — substitute the index to compute any term in one step.

3

\quad \text{Recursive:}\quad a_{n+1} = g(a_n, a_{n-1}, \dots), \quad a_1 = c

Derivation hint: Define later terms in terms of earlier ones plus one or more initial conditions (base cases).

TheoremUniqueness of Terms

If a sequence is a well-defined function, then each index $n$ produces exactly one term $a_n$ . Two sequences $(a_n)$ and $(b_n)$ are equal if and only if $a_n = b_n$ for every $n \in \mathbb{N}$ .

DefinitionMonotonicity and Boundedness

Treating the sequence as a function lets us classify it:

4

\quad \text{Increasing:}\ a_{n+1} > a_n\ \forall n; \qquad \text{Decreasing:}\ a_{n+1} < a_n\ \forall n

Derivation hint: Same definition as monotonic functions, applied only at integer inputs by comparing consecutive terms.

5

\quad \text{Bounded:}\quad \exists\, M > 0 \ \text{such that}\ |a_n| \le M \ \ \forall n \in \mathbb{N}

Derivation hint: A single constant $M$ caps the absolute value of every term — the analogue of a bounded function.

ProofWhy the Function Framework Is Valid

We justify that the list-and-function views coincide. 1. A list defines a function. Given an ordered list $a_1, a_2, a_3, \dots$ , define $a(n)$ = the $n$ -th entry. Since each position has one entry, $a$ is single-valued — a genuine function on $\mathbb{N}$ . 2. A function defines a list. Given $a : \mathbb{N} \to \mathbb{R}$ , write the outputs in index order: $a(1), a(2), a(3), \dots$ . This is an ordered list. 3. The two operations are inverse. Going list $\to$ function $\to$ list returns the original list, and similarly for function $\to$ list $\to$ function. Hence the descriptions are interchangeable. 4. Transfer of structure. Because $a$ is a function, every function property defined pointwise — comparison of values, bounds, and limiting behavior — applies. In particular, $a_n$ may be substituted into any real function: $\sin(a_n)$ , $a_n^2$ , etc., are themselves sequences (compositions of functions). $\blacksquare$

∎

mathematician · Leonhard Euler | 1707–1783

Euler systematized the modern notation and treatment of sequences and series, popularizing the use of functional notation $f(x)$ and treating infinite sequences with the freedom of functions. His work on the harmonic series, the constant $e$ as a limit of $(1 + 1/n)^n$ , and infinite products embodies the function-centric view of sequences. Euler's manipulations — sometimes formal and bold — drove the 18th-century explosion of results that later mathematicians made rigorous through the theory of limits.

🧠 Intuition

Think of a sequence as a vending machine for numbers. You press a button labeled with an integer $n$ , and out comes exactly one number $a_n$ . You can never press button $2.5$ — the machine only accepts whole-number buttons. That restriction (a discrete domain) is the only difference between a sequence and an ordinary function $f(x)$ . This is why the graph of a sequence looks like a dotted constellation rather than a smooth curve: you can only plot points above $n = 1, 2, 3, \dots$ , never in between. If you mentally "fill in the gaps" with a continuous function $f(x)$ that agrees at the integers, you get a powerful tool: the curve's behavior as $x \to \infty$ tells you the sequence's behavior as $n \to \infty$ .

Figure

A sequence as isolated points:

a_n = 1 + 1/n

versus its continuous companion

f(x) = 1 + 1/x

ExampleExplicit Rule and Term Computation

Given: A sequence defined by the explicit function $a_n = 3n - 2$ for $n \in \mathbb{N}$ .

Find: (a) the first four terms, (b) the 50th term, (c) which index gives the value $148$ .

Steps: (a) Evaluate the function at $n = 1, 2, 3, 4$ :

$a_1 = 3(1) - 2 = 1$
$a_2 = 3(2) - 2 = 4$
$a_3 = 3(3) - 2 = 7$
$a_4 = 3(4) - 2 = 10$

(b) Substitute $n = 50$ :

a_{50} = 3(50) - 2 = 150 - 2 = 148

(c) Solve $3n - 2 = 148 \Rightarrow 3n = 150 \Rightarrow n = 50$ . Since $50 \in \mathbb{N}$ , the value $148$ occurs. This is an arithmetic sequence (constant difference $3$ ); the function is linear in $n$ .

Answer:

\boxed{a_1,\dots,a_4 = 1, 4, 7, 10; \quad a_{50} = 148; \quad n = 50}

ExampleRecursive Rule Converted and a Limit Read Off

Given: A recursive sequence $a_{n+1} = \tfrac{1}{2}a_n + 3$ , with $a_1 = 2$ .

Find: (a) the first four terms, (b) the long-run value (limit) by treating it as a fixed point.

Steps: (a) Apply the recursion:

$a_1 = 2$
$a_2 = \tfrac{1}{2}(2) + 3 = 4$
$a_3 = \tfrac{1}{2}(4) + 3 = 5$
$a_4 = \tfrac{1}{2}(5) + 3 = 5.5$

The terms increase and appear to approach a ceiling. (b) If the sequence converges to a limit $L$ , then for large $n$ both $a_{n+1}$ and $a_n$ approach $L$ . Substitute:

L = \tfrac{1}{2}L + 3 \ \Rightarrow\ \tfrac{1}{2}L = 3 \ \Rightarrow\ L = 6

Check: terms $2, 4, 5, 5.5, 5.75, \dots$ climb toward $6$ , never exceeding it — consistent with a bounded, increasing sequence.

Answer:

\boxed{a_1,\dots,a_4 = 2, 4, 5, 5.5; \quad \lim_{n\to\infty} a_n = 6}

⚠️ Common mistake

A sequence is not a continuous curve. Even when you write $a_n = 1/n$ , you must not evaluate it at $n = 2.5$ or draw a smooth line through the points. The domain is the integers only. The continuous companion $f(x) = 1/x$ is a separate function used as an analytical aid — it is not the sequence itself.

The range is not the sequence. The sequence $1, 0, 1, 0, 1, 0, \dots$ has range $\{0, 1\}$ — just two numbers — but it is an infinite, non-constant sequence. Order and repetition are essential to the sequence even though they vanish in the range set.

Counterexample

Claim (false): "If a closed-form formula gives the first few terms correctly, it is the only sequence fitting them."

Refutation: Consider the partial list $2, 4, 8, \dots$ . The natural guess is $a_n = 2^n$ , giving $16, 32, \dots$ . But the formula

a_n = 2^n + (n-1)(n-2)(n-3)

also yields $2, 4, 8$ for $n = 1, 2, 3$ , then continues as $16 + 6 = 22, \dots$ — a completely different sequence. A finite list of terms never uniquely determines a sequence; the defining function (rule) must be specified.

connection

Viewing sequences as functions ties together several neighbouring topics. Arithmetic Sequences are sequences whose generating function is linear in $n$ ( $a_n = a_1 + (n-1)d$ ), and Geometric Sequences are those whose function is exponential in $n$ ( $a_n = a_1 r^{n-1}$ ). The classification of a sequence as increasing, decreasing, or bounded is the discrete shadow of the same concepts for Functions and Their Properties. Pushing the index to infinity leads directly to the Limit of a Sequence, and summing the terms produces an Infinite Series. Recursive definitions connect to Mathematical Induction, the proof technique tailored to statements indexed by $\mathbb{N}$ .

🔬 Where this appears

⏳ History

- c. 300 BCE — Euclid: Elements Book IX treats geometric progressions and proves the sum formula, an early systematic study of structured number lists.

- c. 1202 — Fibonacci (Leonardo of Pisa): Liber Abaci introduces the rabbit problem, popularizing the recursively defined Fibonacci sequence in the West.

- 1655 — John Wallis: Arithmetica Infinitorum uses infinite sequences and interpolation, foreshadowing limits.

- 1668 — Nicholas Mercator / James Gregory: Develop infinite series and the sequences of partial sums, linking sequences to function expansions.

- 1734 — Leonhard Euler: Establishes the limit

e = \lim (1 + 1/n)^n

and treats sequences with full functional notation.

- 1821 — Augustin-Louis Cauchy: Cours d'analyse gives the first rigorous

\varepsilon

-style definition of the limit of a sequence, founding modern analysis.

- 1872 — Karl Weierstrass & Eduard Heine: Formalize convergence and the Bolzano–Weierstrass theorem; the function view of sequences becomes fully rigorous.

- 1888 — Richard Dedekind / Giuseppe Peano (1889): Axiomatize

\mathbb{N}

, providing the precise domain on which sequences-as-functions are defined.

open-problem

Several conceptual subtleties survive at higher levels. Indexing conventions differ: some define $\mathbb{N}$ to start at $0$ , others at $1$ , which shifts every closed-form formula — there is no universal convention. Existence of a closed form is not guaranteed: many recursively defined sequences (and famous ones from number theory, like the prime-counting sequence) have no known elementary explicit formula, and proving that none exists can be deeply hard. The Collatz sequence $a_{n+1} = a_n/2$ (if even) or $3a_n + 1$ (if odd) is perfectly well-defined as a function, yet whether it always reaches $1$ remains an unsolved problem. Finally, distinguishing a sequence (function on $\mathbb{N}$ ) from a net or generalized sequence (function on an arbitrary directed set) matters in advanced topology, where ordinary sequences are no longer sufficient to detect continuity.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also