Sequences can be described using explicit or recursive rules. An explicit formula uses the term number n to calculate a particular term directly. A recursive formula defines a term using one or more previous terms and requires an initial value or starting values. Arithmetic and geometric sequences can be represented in both forms. Explicit formulas are useful when a distant term is needed, while recursive formulas are useful for describing how a sequence develops step by step.
Explicit and Recursive Sequence Formulas
An explicit formula calculates a term directly from its position, while a recursive formula defines each term using one or more earlier terms.
Explicit: aₙ = f(n); Recursive: aₙ = g(aₙ₋₁, n)
Explanation
Variables
| Symbol | Meaning | Unit |
|---|---|---|
aₙ | Current term | Depends on the sequence |
aₙ₋₁ | Previous term | Same as aₙ |
n | Term position | Positive integer |
Example or application
The arithmetic sequence 5, 8, 11, 14, ... has explicit formula aₙ = 5 + 3(n - 1) and recursive formula a₁ = 5, aₙ = aₙ₋₁ + 3 for n ≥ 2.
Key Properties
An explicit formula calculates a term directly.
A recursive formula depends on earlier terms.
Recursive formulas require starting values.
The same sequence can have both explicit and recursive descriptions.
The choice depends on how the sequence will be used.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- SCIENEXY Mathematics Reference