Sequences
What comes next in $2, 4, 6, 8, \ldots$? Easy: 10. How about $1, 1, 2, 3, 5, 8, \ldots$? Trickier (it's 13). Finding the pattern in a list of numbers is like cracking a code, and it's one way math describes things that grow: savings, followers, repeating shapes. By the end of this page you'll know exactly why 13 comes next.
What is a sequence?
Finding the next terms
To continue a list, look at how you get from one term to the next. Two moves show up constantly:
-
Add the same number each time (a constant difference). Example: $2, 5, 8, 11, \ldots$ adds 3.
-
Multiply by the same number each time (a constant ratio). Example: $2, 6, 18, 54, \ldots$ multiplies by 3.
A sequence is increasing if each term is larger than the one before, decreasing if each is smaller, and constant if nothing changes. Some sequences are none of these, like $-1, 1, -1, 1, \ldots$
Sequences often come from real data, and then each term has a meaning.
Observe the following ordered lists of numbers. Your task is to identify the logical rule that each one follows and write the three terms that continue the series: a)…
Observe the following ordered lists of numbers. Your task is to identify the logical rule that each one follows and write the three terms that continue the series:
-
a) $2, 4, 6, 8, \dots$
-
b) $1, 4, 9, 16, \dots$
-
c) $10, 7, 4, 1, \dots$
-
d) $3, 6, 12, 24, \dots$
Imagine you are training for a long-distance race. Your coach notes down the miles you run each week to keep track of your progress. The list for the last 6 weeks is as…
Imagine you are training for a long-distance race. Your coach notes down the miles you run each week to keep track of your progress. The list for the last 6 weeks is as follows:
$$5, 8, 11, 14, 17, 20$$Considering this list as a numerical sequence ($a_n$):
-
What is the value of the term $a_1$? What does it represent in the context of the training?
-
What is the value of the term $a_4$?
-
If you follow the same rate of increase, how many miles will you run in week 7 ($a_7$)?
Explicit formulas
Listing terms gets old fast. An explicit formula gives any term directly from its position, with no need to find all the earlier ones. Some problems call it the general term of the sequence. It's like the source code of the sequence.
If $a_n = n^2 + 1$, then $a_1 = 2$, $a_2 = 5$, $a_3 = 10$, and the 100th term is simply $a_{100} = 100^2 + 1 = 10{,}001$.
Type your own formula in terms of $n$ and watch the terms it produces:
In mathematics, we use formulas to define the value of any position in a sequence without having to write the whole list. This is called the general term ($a_n$).…
In mathematics, we use formulas to define the value of any position in a sequence without having to write the whole list. This is called the general term ($a_n$).
Calculate the first four terms ($a_1, a_2, a_3, a_4$) and the 10th term ($a_{10}$) for the following sequences defined by their general term:
-
a) $a_n = 3n + 1$
-
b) $b_n = n^2 - 2$
Match in your notebook each of the following sequences with its correct general term. Bear in mind that $n$ represents the position (1, 2, 3...). Sequences: A:…
Match in your notebook each of the following sequences with its correct general term. Bear in mind that $n$ represents the position (1, 2, 3...).
Sequences:
-
A: $2, 4, 6, 8, \dots$
-
B: $1, 3, 5, 7, \dots$
-
C: $5, 10, 15, 20, \dots$
-
D: $1, 4, 9, 16, \dots$
General Terms:
-
1: $a_n = 2n - 1$
-
2: $a_n = n^2$
-
3: $a_n = 2n$
-
4: $a_n = 5n$
Given the sequence whose general term is given by the algebraic expression $a_n = \frac{n^2 - 1}{n + 1}$, calculate the first four terms and the 15th term. Do you notice…
Given the sequence whose general term is given by the algebraic expression $a_n = \frac{n^2 - 1}{n + 1}$, calculate the first four terms and the 15th term. Do you notice anything curious when simplifying the initial algebraic expression?
Is this number a term?
Sometimes you're handed a value and asked whether it shows up in the sequence, and where. Set the formula equal to that value and solve for $n$. The answer only counts if $n$ is a positive integer, because a position can't be $25.75$ or $-4$.
Here is a formula whose first terms you can inspect (look for the zeros):
We have a sequence whose general term is $b_n = n^2 - 3n + 2$. 1. Calculate the first 5 terms. 2. Is there any term in the sequence that equals 0? If so, what position…
We have a sequence whose general term is $b_n = n^2 - 3n + 2$.
-
Calculate the first 5 terms.
-
Is there any term in the sequence that equals 0? If so, what position or positions does it occupy? Justify your answer by solving the corresponding equation.
Finding the formula from a pattern
Now the reverse: you see terms and must write the formula. Work through this checklist:
-
Is the difference between terms constant? Then the formula contains $dn$, where $d$ is that difference.
-
Is the ratio constant? Then the formula has a power like $r^n$.
-
Compare the terms with $n$, $n^2$, $n^3$, $2^n$. Subtract to see what's left over.
-
With fractions, find a pattern for the numerators and one for the denominators separately.
-
Test your formula on every term you were given.
Not all sequences are formed by integers (like 1, 2, 3...). They can also have fractions or decimals. Look at the following sequence of real numbers: $$ \frac{1}{2},…
Not all sequences are formed by integers (like 1, 2, 3...). They can also have fractions or decimals. Look at the following sequence of real numbers:
$$ \frac{1}{2}, \frac{1}{3}, \frac{1}{4}, \frac{1}{5}, \dots $$-
Write the next three terms.
-
What do you think is the general term $a_n$? Choose the correct option:
-
Option A: $a_n = \frac{1}{n}$
-
Option B: $a_n = \frac{1}{n+1}$
-
Option C: $a_n = n + 1$
-
Find the general term ($a_n$) of the following sequences. Bear in mind that some may be arithmetic, geometric or perfect squares: a) $5, \ 10, \ 15, \ 20, \ ...$ b)…
Find the general term ($a_n$) of the following sequences. Bear in mind that some may be arithmetic, geometric or perfect squares:
-
a) $5, \ 10, \ 15, \ 20, \ ...$
-
b) $3, \ 6, \ 12, \ 24, \ ...$
-
c) $\frac{1}{2}, \ \frac{1}{4}, \ \frac{1}{8}, \ \frac{1}{16}, \ ...$
-
d) $1, \ 8, \ 27, \ 64, \ ...$
Study the following sequences of real numbers. You must identify the logical pattern of construction and find the general term $a_n$ in terms of $n$ for each of them.…
Study the following sequences of real numbers. You must identify the logical pattern of construction and find the general term $a_n$ in terms of $n$ for each of them.
-
Sequence A: $0, \frac{3}{2}, \frac{8}{3}, \frac{15}{4}, \frac{24}{5}, \dots$
-
Sequence B: $-2, 4, -8, 16, -32, \dots$
-
Sequence C: $2, 5, 10, 17, 26, \dots$
Hint for Sequence A: Look separately at how the numerator evolves and how the denominator evolves. Try to relate the numerator to the square of the position $n$.
Arithmetic and geometric patterns
Two families of sequences appear so often they have their own names (each gets a full page later).
Move the sliders and watch how the two families behave:
A video game streamer decides to start saving to buy new equipment. The first month he saves $\$50$, the second month he saves $\$100$, the third month he saves $\$200…
A video game streamer decides to start saving to buy new equipment.
The first month he saves $\$50$, the second month he saves $\$100$, the third month he saves $\$200$ and the fourth month he saves $\$400$.
-
Write the sequence formed by the money saved each month.
-
Do you notice any regularity? What operation do you do to get from one month to the next?
-
Calculate how much he will save in month 5 and month 6 if he keeps this trend.
Below are several number sequences that follow a logical pattern. Your task is to identify the rule of formation and write the next three terms for each one: a)…
Below are several number sequences that follow a logical pattern. Your task is to identify the rule of formation and write the next three terms for each one:
-
a) $4, \ 7, \ 10, \ 13, \ ...$
-
b) $3, \ -6, \ 12, \ -24, \ ...$
-
c) $1, \ 4, \ 9, \ 16, \ 25, \ ...$
-
d) $\frac{1}{2}, \ \frac{2}{3}, \ \frac{3}{4}, \ \frac{4}{5}, \ ...$
Ashley is training for a marathon. On the first day she runs for 15 minutes. Her coach has prepared a plan where each day she must run 4 minutes more than the previous…
Ashley is training for a marathon. On the first day she runs for 15 minutes. Her coach has prepared a plan where each day she must run 4 minutes more than the previous day.
-
Write the sequence that represents the minutes Ashley runs during the first 5 days.
-
If she keeps to this training plan, how many minutes will she have to run on day 20? Use the general term to calculate it.
Recursive formulas
Sometimes the rule doesn't say how to compute $a_n$ directly. It says how to get each term from the ones before it. That's a recursive formula, and it has two parts: the starting term(s) and the rule. Some problems call this a recurrence relation.
The most famous example is the Fibonacci sequence: each term is the sum of the two before it.
$$a_1 = 1,\quad a_2 = 1,\quad a_n = a_{n-1} + a_{n-2} \text{ for } n \geq 3$$Back to the start: after $1, 1, 2, 3, 5, 8$ comes $5 + 8 = 13$. Mystery solved.
Sometimes, to know the value of a term, we need to know the previous one. This is called a recurrence relation. Given a sequence where the first term is $a_1 = 5$ and…
Sometimes, to know the value of a term, we need to know the previous one. This is called a recurrence relation.
Given a sequence where the first term is $a_1 = 5$ and the rule to obtain the following ones is:
$$a_n = a_{n-1} + 3$$(This means: "the current term is equal to the previous term plus 3").
Calculate the terms $a_2, a_3, a_4$ and $a_5$.
A sequence is defined by a recurrence relation when its terms are obtained by operating on the previous ones. Consider the sequence defined as follows: The first term is…
A sequence is defined by a recurrence relation when its terms are obtained by operating on the previous ones. Consider the sequence defined as follows:
-
The first term is $a_1 = 2$.
-
The second term is $a_2 = 3$.
-
Any subsequent term is calculated by multiplying the two immediately preceding terms: $a_n = a_{n-1} \cdot a_{n-2}$.
Calculate the terms $a_3, a_4, a_5$ and $a_6$. Do you think this sequence grows quickly or slowly?
Consider the sequence defined by the following recurrence relation: $$a_1 = 1, \quad a_2 = 1, \quad a_n = a_{n-1} + a_{n-2} \quad \text{for } n > 2$$ This is the famous…
Consider the sequence defined by the following recurrence relation:
$$a_1 = 1, \quad a_2 = 1, \quad a_n = a_{n-1} + a_{n-2} \quad \text{for } n > 2$$This is the famous Fibonacci sequence.
-
Calculate the first 10 terms of the sequence.
-
We are going to study the behavior of the quotient (division) between two consecutive terms. Calculate the following values to 4 decimal places:
-
$\frac{a_2}{a_1}$
-
$\frac{a_3}{a_2}$
-
$\frac{a_6}{a_5}$
-
$\frac{a_{10}}{a_9}$
-
-
Do you notice that the results are getting closer to a specific number? Investigate which famous irrational number is approximated by dividing consecutive terms of this sequence when $n$ is very large.
Rules with cases and counting ways
Recursive rules can do more than add or multiply. They can change depending on the previous term, or count possibilities.
A rule with two cases
The rule for the Collatz sequence depends on whether the previous term is even or odd:
$$a_n = \begin{cases} \dfrac{a_{n-1}}{2} & \text{if } a_{n-1} \text{ is even} \\[2mm] 3a_{n-1} + 1 & \text{if } a_{n-1} \text{ is odd} \end{cases}$$Nobody has ever proved that every starting number ends up in this loop. It's still an open problem.
Counting ways
Recursive thinking also solves counting problems. Suppose a character climbs a staircase and can jump 1 step or 3 steps at a time. Let $G_n$ be the number of different ways to reach step $n$.
To land on step $n$, the last jump came from step $n - 1$ (a 1-step jump) or from step $n - 3$ (a 3-step jump). So $G_n = G_{n-1} + G_{n-3}$ for $n \geq 4$.
| Steps $n$ | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
|---|---|---|---|---|---|---|---|
| Ways $G_n$ | 1 | 1 | 2 | 3 | 4 | 6 | 9 |
Check $G_3 = 2$: the ways are $1+1+1$ and $3$. For $G_5 = G_4 + G_2 = 3 + 1 = 4$: $1+1+1+1+1$, $3+1+1$, $1+3+1$, $1+1+3$ ✓.
In computer science and algorithm design, it is common to come across the Collatz sequence, also known as the $3n+1$ conjecture. Although it seems simple, it is one of…
In computer science and algorithm design, it is common to come across the Collatz sequence, also known as the $3n+1$ conjecture. Although it seems simple, it is one of the most famous open problems in mathematics.
The rule of formation is recurrent. Given an initial natural number $a_1$, the following terms are obtained like this:
-
If the previous term $a_{n-1}$ is even, the next one is half of it: $a_n = \frac{a_{n-1}}{2}$.
-
If the previous term $a_{n-1}$ is odd, the next one is obtained by multiplying by 3 and adding 1: $a_n = 3 \cdot a_{n-1} + 1$.
-
Write the complete sequence starting with $a_1 = 13$ until you reach the number 1.
-
How many terms does the generated sequence have (orbit length) until it reaches 1 for the first time?
-
Check what happens if you continue applying the rule once you have reached 1. Describe the cycle that is formed.
Imagine a 2D platform video game. The character is at the bottom of a staircase with $n$ steps. The character has two ways to go up: Go up 1 step with a jump. Go up 2…
Imagine a 2D platform video game. The character is at the bottom of a staircase with $n$ steps.
The character has two ways to go up:
-
Go up 1 step with a jump.
-
Go up 2 steps with a super-jump.
We want to know in how many different ways ($F_n$) he can reach the top of the stairs.
-
If there is 1 step ($n=1$): There is only 1 way (jump of 1). $F_1 = 1$.
-
If there are 2 steps ($n=2$): He can do (1+1) or (2). There are 2 ways. $F_2 = 2$.
-
If there are 3 steps ($n=3$): He can do (1+1+1), (1+2) or (2+1). There are 3 ways. $F_3 = 3$.
-
Calculate in how many different ways he can go up a staircase of 4 steps ($F_4$) and 5 steps ($F_5$). Describe them (for example: 1+2+1+1).
-
Find the relationship that exists between $F_n$, $F_{n-1}$ and $F_{n-2}$.
-
If the staircase had 10 steps, in how many different ways could he go up?
Patterns with figures
Many sequences come from figures that grow. To find the formula, count what is added at each step.
-
Count the objects in each figure to get the sequence.
-
Figure out what changes from one figure to the next.
-
If the same amount $d$ is added each time, you have an arithmetic sequence: $a_n = a_1 + (n - 1)d$.
-
Test your formula on figure 1.
Sequences often arise from geometric patterns. Observe the following image showing how a triangle formed by dots grows. Count the number of dots in each figure to form a…
Sequences often arise from geometric patterns. Observe the following image showing how a triangle formed by dots grows.
Count the number of dots in each figure to form a numerical sequence.
-
Write the first 4 terms of this sequence.
-
How many dots will figure 5 have?
-
Without drawing, could you say how many dots are added to go from figure 4 to figure 5?
Look at the following geometric construction made of matchsticks. 1. Draw Figure 4 in your notebook following the same construction logic. 2. Write the number sequence…
Look at the following geometric construction made of matchsticks.
-
Draw Figure 4 in your notebook following the same construction logic.
-
Write the number sequence that represents the total number of matchsticks needed to build each figure ($a_1, a_2, a_3, a_4$).
-
Describe in your own words how the number of matchsticks increases when going from one figure to the next.
In a supermarket, an employee is stacking cans forming a triangular structure for a promotion. In the top row (row 1) he places 1 can. In the row immediately below (row…
In a supermarket, an employee is stacking cans forming a triangular structure for a promotion.
-
In the top row (row 1) he places 1 can.
-
In the row immediately below (row 2) he places 3 cans.
-
In row 3 he places 5 cans.
-
In row 4 he places 7 cans.
Write the sequence that represents the number of cans per row and find a general formula ($a_n$) that allows us to know how many cans there will be in row $n$ without having to count them one by one.
When the added amount grows
What if each figure adds a different amount than the last one? Look at the differences between consecutive terms.
Counting arguments
You can sometimes skip differences and reason directly. If $n$ people each shake hands with everyone else, each person shakes $n - 1$ hands. That counts every handshake twice (once per person), so the total is $\dfrac{n(n - 1)}{2}$. Check $n = 4$: $\frac{4 \cdot 3}{2} = 6$ ✓. The totals $1, 3, 6, 10, \ldots$ for $n = 2, 3, 4, 5$ add $2, 3, 4$ more each time.
The same question ("how many connections does each point have, and did I count each one twice?") counts the diagonals of a polygon. A diagonal joins two vertices that are not neighbors.
Look at the following construction of geometric figures made of small squares. Figure 1 is a single central square. Figure 2 is formed by adding a square to each free…
Look at the following construction of geometric figures made of small squares.
-
Figure 1 is a single central square.
-
Figure 2 is formed by adding a square to each free side of the previous figure (top, bottom, left, right).
-
Figure 3 follows the same pattern, adding squares only to the free outer sides of the previous figure.
You are asked to:
-
Draw Figure 4 in your notebook.
-
Write the sequence formed by the total number of squares in the first 5 figures.
-
Reason and find an algebraic expression for the general term $a_n$ that allows you to calculate the number of squares in the figure in position $n$.
-
Calculate how many squares Figure 20 would have without needing to draw it.
We have a regular polygon with $n$ sides. We want to study the sequence formed by the total number of diagonals this polygon has as its number of sides increases. $a_3$…
We have a regular polygon with $n$ sides. We want to study the sequence formed by the total number of diagonals this polygon has as its number of sides increases.
-
$a_3$ (triangle, 3 sides): 0 diagonals.
-
$a_4$ (square, 4 sides): 2 diagonals.
-
$a_5$ (pentagon, 5 sides): 5 diagonals.
-
Draw a regular hexagon ($n=6$) and draw all its diagonals. What is the value of $a_6$?
-
Notice that to get from $a_3$ to $a_4$ we add 2; from $a_4$ to $a_5$ we add 3; from $a_5$ to $a_6$ we add 4. Following this growth pattern, calculate how many diagonals a decagon ($n=10$) will have.
-
The general term of this sequence is given by the quadratic formula $a_n = \frac{n(n-3)}{2}$. Use this formula to check your result from the previous section.
Sequences from repeating processes
Some sequences come from doing the same thing over and over. Imagine folding a sticky note and keeping the top-left quarter each time. The area is cut to a quarter at every step.
Here the first term is at step 0. Sequences are allowed to start at $n = 0$: the formula for a geometric sequence becomes $a_n = a_0 \cdot r^n$.
Decimals that creep toward a number
Look at $0.9, \ 0.99, \ 0.999, \ \ldots$ Each term is $1 - \dfrac{1}{10^n}$: for $n = 3$ you get $1 - 0.001 = 0.999$. As $n$ gets large, $\tfrac{1}{10^n}$ becomes tiny, so the terms get closer and closer to 1 without ever going past it.
To write a repeating decimal as a fraction, shift it and subtract:
The Sierpinski triangle is defined by an iterative process (which repeats) of removing areas. We start with a black equilateral triangle of area $A = 64 \text{ cm}^2$…
The Sierpinski triangle is defined by an iterative process (which repeats) of removing areas.
We start with a black equilateral triangle of area $A = 64 \text{ cm}^2$ (Iteration 0).
-
Iteration 1: We join the midpoints of the sides and cut out the inverted central triangle (that white triangle is removed). We are left with 3 smaller black triangles.
-
Iteration 2: We repeat the process with each of the 3 remaining black triangles.
You are asked to:
-
Write the sequence $T_n$ that represents the number of black triangles at each step (step 0, step 1, step 2, step 3). What type of sequence is it?
-
Write the sequence $S_n$ that represents the total black area remaining in the figure at each step.
-
Calculate what black area will remain in the figure after performing iteration number 5.
Look at the following sequence of repeating decimals: $$0,\widehat{1}; \quad 0,\widehat{11}; \quad 0,\widehat{111}; \quad \dots$$ Although it seems that we simply "add…
Look at the following sequence of repeating decimals:
$$0,\widehat{1}; \quad 0,\widehat{11}; \quad 0,\widehat{111}; \quad \dots$$Although it seems that we simply "add ones", let's analyze their fractional value.
-
Write the first three terms of the sequence as an irreducible fraction.
-
Find the general term $a_n$ expressed as a fraction.
-
Calculate the sum of the first two terms $a_1 + a_2$ and express the result as a fraction.
-
Investigate and reason: What integer does the term $a_n$ closely approximate when $n$ is a very large number (for example, with 100 ones)? Hint: think about the generating fraction of $0,\widehat{9}$.