Sequences and Recursion
A sequence is an ordered list of numbers, like . Sequences describe anything that happens in steps: savings each month, seats in each row, the height of each bounce. You can describe a sequence with a formula for any term, or with a rule that builds each term from the one before.
Key ideas
Section titled “Key ideas”Terms and notation
Section titled “Terms and notation”The numbers in a sequence are its terms. We write for the first term, for the second, and for the th term (the general term). The subscript is the term’s position:
Sequences are discrete functions
Section titled “Sequences are discrete functions”A sequence is a function whose inputs are the term numbers So you can also write . For example, is the same as with a natural number.
Its graph is a set of separate points, not a joined line. A function like this, defined only at separate values, is a discrete function. A function defined for every real number in an interval, like , is continuous.
Two ways to describe a sequence
Section titled “Two ways to describe a sequence”- General term (explicit formula): gives any term directly from . Example: , so .
- Recursion formula: gives the first term, plus a rule for getting each term from the previous one. Example: , .
A recursion formula always needs a starting value. “Add each time” doesn’t tell you where to start.
Worked examples
Section titled “Worked examples”Example 1: From a general term
Section titled “Example 1: From a general term”For , find the first four terms and .
Solution. Substitute :
Example 2: Which term is it?
Section titled “Example 2: Which term is it?”For , find the first four terms. Which term equals ?
Solution. The first four terms are .
( is also a solution of the equation, but term numbers must be positive.) So .
Example 3: From a recursion formula
Section titled “Example 3: From a recursion formula”Find the first five terms of the sequence with and .
Solution. Each term is double the previous term, minus :
Example 4: Writing both formulas
Section titled “Example 4: Writing both formulas”For the sequence , write a recursion formula and a general term.
Solution. Each term is more than the one before, so a recursion formula is:
For the general term, the terms go up by , so try : that gives , which is too big each time. So , or in function notation, .
Check: . ✓
Common mistakes
Section titled “Common mistakes”Starting at . Term numbers start at , so the first term is .
Mixing up and . is the position; is the value. In Example 2, the answer is “the th term”, not "".
Giving a recursion formula without a first term. fits and also . Always state .
Joining the dots. A sequence’s graph is separate points. There’s no “term number ”.
Dropping brackets with negative signs. For , the signs alternate: and .
Practice
Section titled “Practice”1. (Warm-up) Find the first four terms of .
Solution
2. (Warm-up) For , find .
Solution
3. (Warm-up) Find the first five terms of the sequence with and .
Solution
4. (Core) Find the first four terms of the sequence with and .
Solution
, , . So: .
5. (Core) For , write a recursion formula and a general term.
Solution
Recursion: , .
General term: . (Check: , . ✓)
6. (Core) Which term of equals ?
Solution
, so and . It’s the rd term.
7. (Core) The Fibonacci sequence is defined by , , and . Write its first ten terms.
Solution
Each term is the sum of the two before it:
8. (Core) Find the first four terms of .
Solution
, , , .
9. (Challenge) Find a general term for
Solution
Write each term as a product of consecutive whole numbers: . So .
10. (Challenge) A sequence has and . Find .
Solution
Work backwards: if , then .