Converting recursive & explicit forms of arithmetic sequences

CCSS Math: HSF.BF.A.2
Learn how to convert between recursive and explicit formulas of arithmetic sequences.
Before taking this lesson, make sure you know how to find recursive formulas and explicit formulas of arithmetic sequences.

Converting from a recursive formula to an explicit formula

An arithmetic sequence has the following recursive formula.
$\begin{cases} a(1)=\greenE 3 \\\\ a(n)=a(n-1)\maroonC{+2} \end{cases}$
Recall that this formula gives us the following two pieces of information:
• The first term is $\greenE 3$
• To get any term from its previous term, add $\maroonC 2$. In other words, the common difference is $\maroonC 2$.
Let's find an explicit formula for the sequence.
Remember that we can represent a sequence whose first term is $\greenE A$ and common difference is $\maroonC B$ with the standard explicit form $\greenE A+\maroonC B(n-1)$.
Therefore, an explicit formula of the sequence is $a(n)=\greenE{3}\maroonC{+2}(n-1)$.

1) Write an explicit formula for the sequence.
$\begin{cases} b(1)=-22 \\\\ b(n)=b(n-1)+7 \end{cases}$
$b(n)=$

The standard explicit form for arithmetic sequences is $\greenE A+\maroonC B(n-1)$ where $\greenE A$ is the first term and that $\maroonC B$ is the common difference.
According to the recursive formula,
• the first term is $\greenE{-22}$, and
• the common difference is $\maroonC{7}$.
In conclusion, $b(n)=\greenE{-22}\maroonC{+7}(n-1)$.
2) Write an explicit formula for the sequence.
$\begin{cases} c(1)=8 \\\\ c(n)=c(n-1)-13 \end{cases}$
$c(n)=$

The standard explicit form for arithmetic sequences is $\greenE A+\maroonC B(n-1)$ where $\greenE A$ is the first term and that $\maroonC B$ is the common difference.
According to the recursive formula,
• the first term is $\greenE{8}$, and
• the common difference is $\maroonC{-13}$.
In conclusion, $c(n)=\greenE{8}\maroonC{-13}(n-1)$.

Converting from an explicit formula to a recursive formula

Example 1: Formula is given in standard form

We are given the following explicit formula of an arithmetic sequence.
$d(n)=\greenE 5\maroonC{+16}(n-1)$
This formula is given in the standard explicit form $\greenE A+ \maroonC B(n-1)$ where $\greenE A$ is the first term and that $\maroonC B$ is the common difference. Therefore,
• the first term of the sequence is $\greenE 5$, and
• the common difference is $\maroonC{16}$.
Let's find a recursive formula for the sequence. Recall that the recursive formula gives us two pieces of information:
1. The first term $($which we know is $\greenE 5)$
2. The pattern rule to get any term from the term that comes before it $($which we know is "add $\maroonC{16}$"$)$
Therefore, this is a recursive formula for the sequence.
$\begin{cases} d(1)=\greenE 5\\\\ d(n)=d(n-1)\maroonC{+16} \end{cases}$

Example 2: Formula is given in simplified form

We are given the following explicit formula of an arithmetic sequence.
$e(n)=10+2n$
Note that this formula is not given in the standard explicit form $\greenE A+ \maroonC B(n-1)$.
For this reason, we can't simply use the structure of the formula to find the first term and the common difference. Instead, we can find the first two terms:
• $e(\blueD 1)=10+2\cdot\blueD 1=12$
• $e(\blueD 2)=10+2\cdot\blueD 2=14$
Now we can see that the first term is $\greenE{12}$ and the common difference is $\maroonC{2}$.
Therefore, this is a recursive formula for the sequence.
$\begin{cases} e(1)=\greenE{12}\\\\ e(n)=e(n-1)\maroonC{+2} \end{cases}$

3) The explicit formula of an arithmetic sequence is $f(n)=5+12(n-1)$.
Complete the missing values in the recursive formula of the sequence.
$\begin{cases} f(1)=A\\\\ f(n)=f(n-1)+B \end{cases}$
$A=$
$B=$

In the given recursive formula, $A$ is the first term and $B$ is the common difference.
The explicit formula is given in the standard form $\greenE A+ \maroonC B(n-1)$ where $\greenE A$ is the first term and that $\maroonC B$ is the common difference.
Since the explicit formula is $\greenE{5}\maroonC{+12}(n-1)$, we know that the first term is $\greenE{5}$ and the common difference is $\maroonC{12}$.
In conclusion, $\greenE A=\greenE{5}$ and $\maroonC B=\maroonC{12}$.
4) The explicit formula of an arithmetic sequence is $g(n)=-11-8(n-1)$.
Complete the missing values in the recursive formula of the sequence.
$\begin{cases} g(1)=A\\\\ g(n)=g(n-1)+B \end{cases}$
$A=$
$B=$

In the given recursive formula, $A$ is the first term and $B$ is the common difference.
The explicit formula is given in the standard form $\greenE A+ \maroonC B(n-1)$ where $\greenE A$ is the first term and that $\maroonC B$ is the common difference.
Since the explicit formula is $\greenE{-11}\maroonC{-8}(n-1)$, we know that the first term is $\greenE{-11}$ and the common difference is $\maroonC{-8}$.
In conclusion, $\greenE A=\greenE{-11}$ and $\maroonC B=\maroonC{-8}$.
5) The explicit formula of an arithmetic sequence is $h(n)=1+4n$.
Complete the missing values in the recursive formula of the sequence.
$\begin{cases} h(1)=A\\\\ h(n)=h(n-1)+B \end{cases}$
$A=$
$B=$

In the given recursive formula, $\greenE A$ is the first term and $\maroonC B$ is the common difference.
Note that the explicit formula is not given in the standard form $\greenE A+\maroonC B(n-1)$.
Let's find the first two terms:
• $h(\blueD 1)=1+4\cdot\blueD 1=5$
• $h(\blueD 2)=1+4\cdot\blueD 2=9$
Now we can see that the first term is $\greenE{5}$ and the common difference is $\maroonC{4}$.
Therefore, $\greenE A=\greenE{5}$ and $\maroonC B=\maroonC{4}$.
6) The explicit formula of an arithmetic sequence is $i(n)=23-6n$.
Complete the missing values in the recursive formula of the sequence.
$\begin{cases} i(1)=A\\\\ i(n)=i(n-1)+B \end{cases}$
$A=$
$B=$

In the given recursive formula, $\greenE A$ is the first term and $\maroonC B$ is the common difference.
Note that the explicit formula is not given in the standard form $\greenE A+\maroonC B(n-1)$.
Let's find the first two terms:
• $i(\blueD 1)=23-6\cdot\blueD 1=17$
• $i(\blueD 2)=23-6\cdot\blueD 2=11$
Now we can see that the first term is $\greenE{17}$ and the common difference is $\maroonC{-6}$.
Therefore, $\greenE A=\greenE{17}$ and $\maroonC B=\maroonC{-6}$.

Challenge problem

7*) Select all the formulas that correctly represent the arithmetic sequence $101, 114, 127,...$

The first term of the sequence is $\greenE{101}$, and the common difference is $\maroonC{13}$.
Therefore, this is the correct recursive formula for the sequence.
$\begin{cases} j(1)=\greenE{101}\\\\ j(n)=j(n-1)\maroonC{+13} \end{cases}$
The other recursive formulas have the wrong first term.
This is the standard form explicit formula for the sequence.
$j(n)=\greenE{101}\maroonC{+13}(n-1)$
We can simplify it to find another correct formula.
\begin{aligned}j(n)&=101+13(n-1)\\\\ &=101+13n-13\\\\ &=88+13n\end{aligned}
The other explicit formulas are not equivalent to the the above formula, and therefore are incorrect.
In conclusion, these are the correct formulas:
• $\begin{cases} j(1)=101\\\\ j(n)=j(n-1)+13 \end{cases}$
• $j(n)=101+13(n-1)$
• $j(n)=88+13n$