Terminology of Sequences

Learning Outcomes

  • Find the formula for the general term of a sequence

To work with this new topic, we need some new terms and definitions. First, an infinite sequence is an ordered list of numbers of the form

a1,a2,a3,,an,.

 

Each of the numbers in the sequence is called a term. The symbol n is called the index variable for the sequence. We use the notation

{an}n=1,or simply{an},

 

to denote this sequence. A similar notation is used for sets, but a sequence is an ordered list, whereas a set is not ordered. Because a particular number an exists for each positive integer n, we can also define a sequence as a function whose domain is the set of positive integers.

Let’s consider the infinite, ordered list

2,4,8,16,32,.

 

This is a sequence in which the first, second, and third terms are given by a1=2, a2=4, and a3=8. You can probably see that the terms in this sequence have the following pattern:

a1=21,a2=22,a3=23,a4=24,and a5=25.

 

Assuming this pattern continues, we can write the nth term in the sequence by the explicit formula an=2n. Using this notation, we can write this sequence as

{2n}n=1or{2n}.

 

Alternatively, we can describe this sequence in a different way. Since each term is twice the previous term, this sequence can be defined recursively by expressing the nth term an in terms of the previous term an1. In particular, we can define this sequence as the sequence {an} where a1=2 and for all n2, each term an is defined by the recurrence relation an=2an1.

Definition


An infinite sequence {an} is an ordered list of numbers of the form

a1,a2,,an,.

The subscript n is called the index variable of the sequence. Each number an is a term of the sequence. Sometimes sequences are defined by explicit formulas, in which case an=f(n) for some function f(n) defined over the positive integers. In other cases, sequences are defined by using a recurrence relation. In a recurrence relation, one term (or more) of the sequence is given explicitly, and subsequent terms are defined in terms of earlier terms in the sequence.

Note that the index does not have to start at n=1 but could start with other integers. For example, a sequence given by the explicit formula an=f(n) could start at n=0, in which case the sequence would be

a0,a1,a2,.

 

Similarly, for a sequence defined by a recurrence relation, the term a0 may be given explicitly, and the terms an for n1 may be defined in terms of an1. Since a sequence {an} has exactly one value for each positive integer n, it can be described as a function whose domain is the set of positive integers. As a result, it makes sense to discuss the graph of a sequence. The graph of a sequence {an} consists of all points (n,an) for all positive integers n. Figure 1 shows the graph of {2n}.

A graph in quadrant one containing the following points: (1, 2), (2, 4), (3, 8), (4, 16).

Figure 1. The plotted points are a graph of the sequence {2n}.

Two types of sequences occur often and are given special names: arithmetic sequences and geometric sequences. In an arithmetic sequence, the difference between every pair of consecutive terms is the same. For example, consider the sequence

3,7,11,15,19,.

 

You can see that the difference between every consecutive pair of terms is 4. Assuming that this pattern continues, this sequence is an arithmetic sequence. It can be described by using the recurrence relation

{a1=3an=an1+4 for n2

 

Note that

a2=3+4a3=3+4+4=3+24a4=3+4+4+4=3+34.

 

Thus the sequence can also be described using the explicit formula

an=3+4(n1)=4n1.

 

In general, an arithmetic sequence is any sequence of the form an=cn+b.

In a geometric sequence, the ratio of every pair of consecutive terms is the same. For example, consider the sequence

2,23,29,227,281,.

 

We see that the ratio of any term to the preceding term is 13. Assuming this pattern continues, this sequence is a geometric sequence. It can be defined recursively as

a1=2an=13an1 for n2.

 

Alternatively, since

a2=132a3=(13)(13)(2)=(13)22a4=(13)(13)(13)(2)=(13)32,

 

we see that the sequence can be described by using the explicit formula

an=2(13)n1.

 

The sequence {2n} that we discussed earlier is a geometric sequence, where the ratio of any term to the previous term is 2. In general, a geometric sequence is any sequence of the form an=crn.

Example: Finding Explicit Formulas

For each of the following sequences, find an explicit formula for the nth term of the sequence.

  1. 12,23,34,45,56,
  2. 34,97,2710,8113,24316,

try it

Find an explicit formula for the nth term of the sequence {15,17,19,111,}.

Watch the following video to see the worked solution to the above Try IT.

For closed captioning, open the video on its original page by clicking the Youtube logo in the lower right-hand corner of the video display. In YouTube, the video will begin at the same starting point as this clip, but will continue playing until the very end.

You can view the transcript for this segmented clip of “5.1.1” here (opens in new window).

Example: Defined by Recurrence Relations

For each of the following recursively defined sequences, find an explicit formula for the sequence.

  1. a1=2, an=3an1 for n2
  2. a1=12, an=an1+(12)n for n2

try it

Find an explicit formula for the sequence defined recursively such that a1=4 and an=an1+6.

Watch the following video to see the worked solution to the above Try IT.

For closed captioning, open the video on its original page by clicking the Youtube logo in the lower right-hand corner of the video display. In YouTube, the video will begin at the same starting point as this clip, but will continue playing until the very end.

You can view the transcript for this segmented clip of “5.1.1” here (opens in new window).

Try It