Skip to ContentGo to accessibility pageKeyboard shortcuts menu
OpenStax Logo
Algebra 1

4.14.2 What Is a Sequence?

Algebra 14.14.2 What Is a Sequence?

Search for key terms or text.

Activity

In the Tower of Hanoi puzzle, a set of discs sits on a peg, while there are 2 other empty pegs.

A move in the Tower of Hanoi puzzle involves taking a disc and moving it to another peg. There are two rules:

  • Only move 1 disc at a time.
  • Never put a larger disc on top of a smaller one.

You complete the puzzle by building the complete tower on a different peg from the starting peg.

1. What is the smallest number of moves in which you are able to complete the puzzle with 3 discs?

2. What is the smallest number of moves in which you are able to complete the puzzle with 4 discs?

3. Jada says she used the solution for 3 discs to help her solve the puzzle for 4 discs. Describe how this might happen.

4. How many moves do you think it will take to complete a puzzle with 5 discs? Explain.

5. How many moves do you think it will take to complete a puzzle with 7 discs?

In this activity, you have started to find a sequence of terms.

Write these definitions in your math notebook.

  • A sequence is a list of numbers, possibly going on forever, such as all the odd positive integers arranged in order: 1, 3, 5, 7, . . . .
  • The term (of a sequence) is one of the numbers in a sequence.

Self Check

Self Check

The table below shows the number of chips in a game and the number of moves that can be made.

Number of chips 1 2 3 4
Number of possible moves 3 5 7 9

How many moves would be possible with 7 chips?

  1. 13
  2. 15
  3. 14
  4. 11

Additional Resources

Using a Table to Find the Pattern

Sometimes it is helpful to keep a table to find the pattern needed to answer a question.

For the Tower of Hanoi game, enter the number of discs used and the smallest number of moves to solve the puzzle in a table like the one below. Use the answers from the activity.

Number of Discs 3 4 5 6 7 8
Number of Moves to Solve Puzzle 7 15 31 ? 127 ?

The pattern was to double the previous answer and then add 1.

Using this pattern, complete the table for 6 discs.

2(31)+1=632(31)+1=63

Then use this rule to find how many moves are needed to complete the puzzle with 8 discs.

There were 127 moves for 7 discs.

So, double 127 and add 1: 2(127)+1=2552(127)+1=255.

Try it

Try It: Using a Table to Find the Pattern

Now it’s your turn. For the same game, how many moves would it take to solve the puzzle with 9 discs?

Citation/Attribution

This book may not be used in the training of large language models or otherwise be ingested into large language models or generative AI offerings without OpenStax's permission.

Want to cite, share, or modify this book? This book uses the Creative Commons Attribution-NonCommercial-ShareAlike License and you must attribute OpenStax.

Attribution information
  • If you are redistributing all or part of this book in a print format, then you must include on every physical page the following attribution:

    Access for free at https://openstax.org/books/algebra-1/pages/about-this-course

  • If you are redistributing all or part of this book in a digital format, then you must include on every digital page view the following attribution:

    Access for free at https://openstax.org/books/algebra-1/pages/about-this-course

Citation information

© May 21, 2025 OpenStax. Textbook content produced by OpenStax is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike License . The OpenStax name, OpenStax logo, OpenStax book covers, OpenStax CNX name, and OpenStax CNX logo are not subject to the Creative Commons license and may not be reproduced without the prior and express written consent of Rice University.