<< Chapter < Page Chapter >> Page >

Write an explicit formula for the n th term of the sequence.

{9, 81, 729, 6,561, 59,049, …}

a n = ( 1 ) n + 1 9 n

Got questions? Get instant answers now!

Write an explicit formula for the n th term of the sequence.

{ 3 4 , 9 8 , 27 12 , 81 16 , 243 20 , ... }

a n = 3 n 4 n

Got questions? Get instant answers now!

Write an explicit formula for the n th term of the sequence.

{ 1 e 2 ,   1 e ,   1 ,   e ,   e 2 , ... }

a n = e n 3

Got questions? Get instant answers now!

Writing the terms of a sequence defined by a recursive formula

Sequences occur naturally in the growth patterns of nautilus shells, pinecones, tree branches, and many other natural structures. We may see the sequence in the leaf or branch arrangement, the number of petals of a flower, or the pattern of the chambers in a nautilus shell. Their growth follows the Fibonacci sequence, a famous sequence in which each term can be found by adding the preceding two terms. The numbers in the sequence are 1, 1, 2, 3, 5, 8, 13, 21, 34,…. Other examples from the natural world that exhibit the Fibonacci sequence are the Calla Lily, which has just one petal, the Black-Eyed Susan with 13 petals, and different varieties of daisies that may have 21 or 34 petals.

Each term of the Fibonacci sequence depends on the terms that come before it. The Fibonacci sequence cannot easily be written using an explicit formula. Instead, we describe the sequence using a recursive formula , a formula that defines the terms of a sequence using previous terms.

A recursive formula always has two parts: the value of an initial term (or terms), and an equation defining a n in terms of preceding terms. For example, suppose we know the following:

a 1 = 3 a n = 2 a n 1 1 ,   for   n 2

We can find the subsequent terms of the sequence using the first term.

a 1 = 3 a 2 = 2 a 1 1 = 2 ( 3 ) 1 = 5 a 3 = 2 a 2 1 = 2 ( 5 ) 1 = 9 a 4 = 2 a 3 1 = 2 ( 9 ) 1 = 17

So the first four terms of the sequence are { 3 ,   5 ,   9 ,   17 } .

The recursive formula for the Fibonacci sequence states the first two terms and defines each successive term as the sum of the preceding two terms.

a 1 = 1 a 2 = 1 a n = a n 1 + a n 2 ,   for     n 3

To find the tenth term of the sequence, for example, we would need to add the eighth and ninth terms. We were told previously that the eighth and ninth terms are 21 and 34, so

a 10 = a 9 + a 8 = 34 + 21 = 55

Recursive formula

A recursive formula    is a formula that defines each term of a sequence using preceding term(s). Recursive formulas must always state the initial term, or terms, of the sequence.

Must the first two terms always be given in a recursive formula?

No. The Fibonacci sequence defines each term using the two preceding terms, but many recursive formulas define each term using only one preceding term. These sequences need only the first term to be defined.

Given a recursive formula with only the first term provided, write the first n terms of a sequence.

  1. Identify the initial term, a 1 , which is given as part of the formula. This is the first term.
  2. To find the second term, a 2 , substitute the initial term into the formula for a n 1 . Solve.
  3. To find the third term, a 3 , substitute the second term into the formula. Solve.
  4. Repeat until you have solved for the n th term.

Writing the terms of a sequence defined by a recursive formula

Write the first five terms of the sequence defined by the recursive formula.

a 1 = 9 a n = 3 a n 1 20 , for  n 2

The first term is given in the formula. For each subsequent term, we replace a n 1 with the value of the preceding term.

n = 1 a 1 = 9 n = 2 a 2 = 3 a 1 20 = 3 ( 9 ) 20 = 27 20 = 7 n = 3 a 3 = 3 a 2 20 = 3 ( 7 ) 20 = 21 20 = 1 n = 4 a 4 = 3 a 3 20 = 3 ( 1 ) 20 = 3 20 = 17 n = 5 a 5 = 3 a 4 20 = 3 ( 17 ) 20 = 51 20 = 71

The first five terms are { 9 ,   7 ,   1 ,   17 ,   71 } . See [link] .

Graph of a scattered plot with labeled points: (1, 9), (2, 7), (3, 1), (4, -17), and (5, -71). The x-axis is labeled n and the y-axis is labeled a_n.
Got questions? Get instant answers now!
Got questions? Get instant answers now!
Practice Key Terms 8

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Precalculus. OpenStax CNX. Jan 19, 2016 Download for free at https://legacy.cnx.org/content/col11667/1.6
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Precalculus' conversation and receive update notifications?

Ask