Skip to content
Family Table Math

Sequences and Recursion

A sequence is an ordered list of numbers, like 3,5,7,9,…3, 5, 7, 9, \dots. 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.

The numbers in a sequence are its terms. We write t1t_1 for the first term, t2t_2 for the second, and tnt_n for the nnth term (the general term). The subscript nn is the term’s position: 1,2,3,…1, 2, 3, \dots

A sequence is a function whose inputs are the term numbers n=1,2,3,…n = 1, 2, 3, \dots So you can also write tn=f(n)t_n = f(n). For example, tn=2n+1t_n = 2n + 1 is the same as f(n)=2n+1f(n) = 2n + 1 with nn 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 f(x)=2x+1f(x) = 2x + 1, is continuous.

Six separate points (1, 3), (2, 5), (3, 7), (4, 9), (5, 11), (6, 13) for the sequence t sub n = 2n + 1, lying on a faint dashed line that is not part of the sequence 1 2 3 4 5 6 2 4 6 8 10 12 (3, 7) (6, 13) term number n tₙ = 2n + 1
The sequence is only the dots. The dashed line, y=2x+1y = 2x + 1, is the continuous function they lie on.
  • General term (explicit formula): gives any term directly from nn. Example: tn=2n+1t_n = 2n + 1, so t50=101t_{50} = 101.
  • Recursion formula: gives the first term, plus a rule for getting each term from the previous one. Example: t1=3t_1 = 3, tn=tn−1+2t_n = t_{n - 1} + 2.

A recursion formula always needs a starting value. “Add 22 each time” doesn’t tell you where to start.

For tn=3n−2t_n = 3n - 2, find the first four terms and t20t_{20}.

Solution. Substitute n=1,2,3,4n = 1, 2, 3, 4:

t1=1,t2=4,t3=7,t4=10t_1 = 1, \quad t_2 = 4, \quad t_3 = 7, \quad t_4 = 10 t20=3(20)−2=58t_{20} = 3(20) - 2 = 58

For tn=n2+1t_n = n^2 + 1, find the first four terms. Which term equals 101101?

Solution. The first four terms are 2,5,10,172, 5, 10, 17.

n2+1=101⇒n2=100⇒n=10n^2 + 1 = 101 \quad\Rightarrow\quad n^2 = 100 \quad\Rightarrow\quad n = 10

(n=−10n = -10 is also a solution of the equation, but term numbers must be positive.) So t10=101t_{10} = 101.

Find the first five terms of the sequence with t1=5t_1 = 5 and tn=2tn−1−3t_n = 2t_{n - 1} - 3.

Solution. Each term is double the previous term, minus 33:

t1=5t2=2(5)−3=7t3=2(7)−3=11t4=2(11)−3=19t5=2(19)−3=35\begin{aligned} t_1 &= 5 \\ t_2 &= 2(5) - 3 = 7 \\ t_3 &= 2(7) - 3 = 11 \\ t_4 &= 2(11) - 3 = 19 \\ t_5 &= 2(19) - 3 = 35 \end{aligned}

For the sequence 4,9,14,19,…4, 9, 14, 19, \dots, write a recursion formula and a general term.

Solution. Each term is 55 more than the one before, so a recursion formula is:

t1=4,tn=tn−1+5t_1 = 4, \qquad t_n = t_{n - 1} + 5

For the general term, the terms go up by 55, so try 5n5n: that gives 5,10,15,205, 10, 15, 20, which is 11 too big each time. So tn=5n−1t_n = 5n - 1, or in function notation, f(n)=5n−1f(n) = 5n - 1.

Check: t4=5(4)−1=19t_4 = 5(4) - 1 = 19. ✓

Starting at n=0n = 0. Term numbers start at 11, so the first term is t1t_1.

Mixing up nn and tnt_n. nn is the position; tnt_n is the value. In Example 2, the answer is “the 1010th term”, not "101101".

Giving a recursion formula without a first term. tn=tn−1+5t_n = t_{n - 1} + 5 fits 4,9,14,…4, 9, 14, \dots and also 1,6,11,…1, 6, 11, \dots. Always state t1t_1.

Joining the dots. A sequence’s graph is separate points. There’s no “term number 2.52.5”.

Dropping brackets with negative signs. For tn=(−1)nn2t_n = (-1)^n n^2, the signs alternate: t1=−1t_1 = -1 and t2=4t_2 = 4.

1. (Warm-up) Find the first four terms of tn=4n+3t_n = 4n + 3.

Solution

7,11,15,197, 11, 15, 19

2. (Warm-up) For tn=2n−1t_n = 2^n - 1, find t5t_5.

Solution

t5=25−1=31t_5 = 2^5 - 1 = 31

3. (Warm-up) Find the first five terms of the sequence with t1=2t_1 = 2 and tn=tn−1+6t_n = t_{n - 1} + 6.

Solution

2,8,14,20,262, 8, 14, 20, 26

4. (Core) Find the first four terms of the sequence with t1=1t_1 = 1 and tn=3tn−1+1t_n = 3t_{n - 1} + 1.

Solution

t2=3(1)+1=4t_2 = 3(1) + 1 = 4, t3=3(4)+1=13t_3 = 3(4) + 1 = 13, t4=3(13)+1=40t_4 = 3(13) + 1 = 40. So: 1,4,13,401, 4, 13, 40.

5. (Core) For 6,11,16,21,…6, 11, 16, 21, \dots, write a recursion formula and a general term.

Solution

Recursion: t1=6t_1 = 6, tn=tn−1+5t_n = t_{n - 1} + 5.

General term: tn=5n+1t_n = 5n + 1. (Check: t1=6t_1 = 6, t4=21t_4 = 21. ✓)

6. (Core) Which term of tn=7n−4t_n = 7n - 4 equals 157157?

Solution

7n−4=1577n - 4 = 157, so 7n=1617n = 161 and n=23n = 23. It’s the 2323rd term.

7. (Core) The Fibonacci sequence is defined by t1=1t_1 = 1, t2=1t_2 = 1, and tn=tn−1+tn−2t_n = t_{n - 1} + t_{n - 2}. Write its first ten terms.

Solution

Each term is the sum of the two before it:

1,1,2,3,5,8,13,21,34,551, 1, 2, 3, 5, 8, 13, 21, 34, 55

8. (Core) Find the first four terms of tn=(−1)nn2t_n = (-1)^n n^2.

Solution

t1=−1t_1 = -1, t2=4t_2 = 4, t3=−9t_3 = -9, t4=16t_4 = 16.

9. (Challenge) Find a general term for 2,6,12,20,30,…2, 6, 12, 20, 30, \dots

Solution

Write each term as a product of consecutive whole numbers: 1×2, 2×3, 3×4, 4×5, 5×61 \times 2,\ 2 \times 3,\ 3 \times 4,\ 4 \times 5,\ 5 \times 6. So tn=n(n+1)t_n = n(n + 1).

10. (Challenge) A sequence has tn=2tn−1+1t_n = 2t_{n - 1} + 1 and t4=31t_4 = 31. Find t1t_1.

Solution

Work backwards: if tn=2tn−1+1t_n = 2t_{n - 1} + 1, then tn−1=tn−12t_{n - 1} = \dfrac{t_n - 1}{2}.

t3=31−12=15,t2=15−12=7,t1=7−12=3t_3 = \frac{31 - 1}{2} = 15, \qquad t_2 = \frac{15 - 1}{2} = 7, \qquad t_1 = \frac{7 - 1}{2} = 3