Every function you have met so far — lines, parabolas, exponentials — takes ANY real number as input. A sequence is different: it is a list of numbers, in order, where the input is only allowed to be a counting number (1st, 2nd, 3rd, ...). Think of a stack of loonies growing by 3 each day, or the balance in a savings account at the end of each year. You cannot ask for the "2.5th" term of a list — that question doesn't make sense. This is what makes a sequence a discrete function rather than a continuous one.
Term notation
We write the terms of a sequence as . The subscript is the term NUMBER (which position in the list), and is the term VALUE (what's actually there). For the sequence we'd say , , , and so on. The first term is often also called . Because each position gives exactly one value, a sequence really is a function: you could write instead of , and its graph is the set of ordered pairs , such as . A sequence that stops, like the 12 monthly balances in a year, is finite; one that goes on forever, shown by the trailing "", is infinite.
Explicit vs. recursive formulas
There are two completely different ways to describe a sequence with a formula. An EXPLICIT formula gives you directly from — plug in and you instantly get with no other work. A RECURSIVE formula instead tells you how to get the next term from the previous one(s), so you must know a starting value and climb your way up term by term.
- Gives directly in terms of
- Example:
- Jump straight to : plug in
- No starting term needed in the formula itself
- Gives in terms of earlier term(s)
- Example:
- To get you must compute every term before it
- Always needs a stated starting value like
Why bother with recursion if explicit formulas are faster? Because recursion describes the process, and many real situations are processes: "each year the balance is 1.05 times last year's balance plus a 100 dollar deposit" is naturally . Recursion is also how spreadsheets and computer programs build sequences, one cell from the one above. The two sequence families in this unit have simple recursive forms that convert straight to explicit ones: an arithmetic rule gives , and a geometric rule gives . Some recursions use two earlier terms, like the Fibonacci sequence , , which gives .
| n | Rule: | |
|---|---|---|
| 1 | given | 5 |
| 2 | 7 | |
| 3 | 11 | |
| 4 | 19 | |
| 5 | 35 |
Finding a pattern honestly
- Write out at least 4–5 consecutive terms.
- Compute first differences:
- If the first differences are constant, you likely have an arithmetic sequence (next topic).
- If instead consecutive terms have a constant RATIO, you likely have a geometric sequence.
- If neither is constant, check second differences (differences of the differences) — a constant second difference signals a quadratic-type pattern, which is common but not arithmetic or geometric.
Writing a formula from a pattern
When the terms are not arithmetic or geometric, compare each term to its position number and look for a familiar pattern. Squares give ; one less than the squares gives . Fractions often split into a numerator pattern and a denominator pattern: is . Alternating signs come from powers of : is , so is . Always test your formula on at least two terms that you did not use to build it.