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

4.17.2 What Is a Recursive Definition?

Algebra 14.17.2 What Is a Recursive Definition?

Search for key terms or text.

Activity

The recursive definition is a function that provides a repeated, or recurring, process to find terms in a sequence.

Start with the recursive definition: R ( n ) = 3 R ( n 1 ) + 1 R ( n ) = 3 R ( n 1 ) + 1 , n 2 n 2 and given R ( 1 ) = 1 R ( 1 ) = 1 .

A recurrence relation is shown: R of n equals 3 times R of n minus 1 plus 1 for n greater than or equal to 2, with the initial condition R of 1 equals negative 1. Arrows label the rule, domain, and basis in different colors.
  • The first part of the recursive definition provides the instructions for how to generate the sequence. It provides the function rule or formula for the nth term.
  • The second part states the domain of the sequence. It describes where we start and the values that are substituted into the function.
  • The third part is the basis for the sequence or the smallest term value.

See the table below for how to substitute to find more terms in the sequence using the recursive definition. Substitute the term number, n n , in for n n in the recursive definition. Complete the table with a partner.

Term number (n) Substitute in R ( n ) R ( n ) Value
1 given -1
2 3 R ( 2 1 ) + 1 = 3 R ( 1 ) + 1 = 3 ( 1 ) + 1 = 2 3 R ( 2 1 ) + 1 = 3 R ( 1 ) + 1 = 3 ( 1 ) + 1 = 2 -2
3 3 R ( 3 1 ) + 1 = 3 R ( 2 ) + 1 = 3 ( 2 ) + 1 = 5 3 R ( 3 1 ) + 1 = 3 R ( 2 ) + 1 = 3 ( 2 ) + 1 = 5 -5
4 3 R ( 4 1 ) + 1 = 3 R ( 3 ) + 1 = 3 ( 5 ) + 1 3 R ( 4 1 ) + 1 = 3 R ( 3 ) + 1 = 3 ( 5 ) + 1 a. ___
5 a. ___ b. ___
6 b. ___ c. ___

1. Using the recursive definition:

a. Substitute n = 5 n = 5 in R ( n ) R ( n )

b. Substitute n = 6 n = 6 in R ( n ) R ( n )

2. Determine the value for each term:

a. Value when n = 4 n = 4

b. Value when n = 5 n = 5

c. Value when n = 6 n = 6

3. Write the full sequence out to 6 terms.

4. Determine if the following sequences are arithmetic or geometric.

a. 3, 6, 12, 24

b. 18, 36, 72, 144

c. 3, 8, 13, 18

d. 18, 13, 8, 3

e. 18, 9, 4.5, 2.25

f. 18, 20, 22, 24

g. 3, 15, 75, 375

Video: Learning About Recursive Definitions and Sequences

Watch the following video to learn more about matching sequences to their recursive definitions.

Self Check

Self Check

Which of the following sequences matches the recursive definition for G ( n ) where G ( n ) = G ( n 1 ) + 4 for n 2 when G ( 1 ) = 3 ?

  1. 3, 12, 48, 144
  2. 3, 7, 11, 15
  3. 1, 3, 7, 11, 15
  4. 4, 8, 12, 16, 20

Additional Resources

Writing Recursive Definitions

Sometimes we can define a sequence recursively. That is, we can describe how to calculate the next term in a sequence if we know the previous term.

Here’s a sequence: 6, 10, 14, 18, 22, . . . This is an arithmetic sequence, where each term is 4 more than the previous term. Since sequences are functions, let’s call this sequence f f . Then we can use function notation to write f ( n ) = f ( n 1 ) + 4 f ( n ) = f ( n 1 ) + 4 . Here, f ( n ) f ( n ) is the term, f ( n 1 ) f ( n 1 ) is the previous term, and + 4 represents the common difference since f f is an arithmetic sequence.

When we define a function recursively, we must also say what the first term is. Without that, there would be no way of knowing if the sequence defined by f ( n ) = f ( n 1 ) + 4 f ( n ) = f ( n 1 ) + 4 started with 6 or 81 or any other number. Here, one possible initial condition is f ( 1 ) = 6 f ( 1 ) = 6 . It could also make sense to number the terms starting with 0, using f ( 0 ) = 6 f ( 0 ) = 6 .

Combining this information gives the recursive definition: f ( 1 ) = 6 f ( 1 ) = 6 and f ( n ) = f ( n 1 ) + 4 f ( n ) = f ( n 1 ) + 4 for n 2 n 2 , where n n is an integer. We include the n 2 n 2 at the end since the value of f f at 1 is already given, and the other terms in the sequence are generated by inputting integers larger than 1 into the definition.

Let’s look at some examples from the first activity and write the recursive definition for each type of sequence:

Example 1

Sequence A: 30 , 40 , 50 , 60 , 70 , 30 , 40 , 50 , 60 , 70 ,

Step 1 - Determine the type of sequence

This sequence is arithmetic.

Step 2 - Determine the common difference or common ratio

The terms increase by adding a value of 10, so the common difference is 10.

Step 3 - Determine the formula or rule

Since one term’s value comes from adding 10 to the term value before it, that means n = ( n 1 ) + 10 n = ( n 1 ) + 10 . Now write this rule using function notation.

A ( n ) = A ( n 1 ) + 10 A ( n ) = A ( n 1 ) + 10

Step 4 - Determine the initial condition or basis

A ( 1 ) = 30 A ( 1 ) = 30

Step 5 - Determine the domain of the formula

We use the first term to find the second term, so that is where we start at n = 2 n = 2 . So, our domain is n 2 n 2 .

The recursive definition for 30, 40, 50, 60, 70, … is A ( 1 ) = 30 A ( 1 ) = 30 , A ( n ) = A ( n 1 ) + 10 A ( n ) = A ( n 1 ) + 10 , n 2 n 2 .

Example 2

Sequence B: 80 , 40 , 20 , 10 , 5 , 2.5 , 80 , 40 , 20 , 10 , 5 , 2.5 ,

Step 1 - Determine the type of sequence

This sequence is geometric.

Step 2 - Determine the common difference or common ratio

The terms are divided by 2 each time, so the common ratio is 1 2 1 2 (since it is divided by 2).

Step 3 - Determine the formula or rule

Since one term’s value comes from multiplying 1 2 1 2 to the term value before it, that means n = ( n 1 ) × 1 2 n = ( n 1 ) × 1 2 . Now write this rule using function notation.

B ( n ) = B ( n 1 ) × 1 2 B ( n ) = B ( n 1 ) × 1 2

Step 4 - Determine the initial condition or basis

B ( 1 ) = 80 B ( 1 ) = 80

Step 5 - Determine the domain of the formula

We use the first term to find the second term, so that is where we start at n = 2 n = 2 . So, our domain is n 2 n 2 .

The recursive definition for 80, 40, 20, 10, 5, 2.5, … is B ( 1 ) = 80 B ( 1 ) = 80 , B ( n ) = B ( n 1 ) × 1 2 B ( n ) = B ( n 1 ) × 1 2 , n 2 n 2 .

Example 3

Sequence F: 1 , 3 , 7 , 15 , 31 , 1 , 3 , 7 , 15 , 31 ,

Step 1 - Determine the type of sequence

This sequence is neither arithmetic nor geometric.

Try it

Try It: Writing Recursive Definitions

Write E ( 1 ) E ( 1 ) and a recursive definition for E ( n ) E ( n ) :

E: 20, 13, 6, –1, –8, . . .

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.