Recursive Rules for Sequences — I can write a recursive rule for an arithmetic sequence and explain how it works. - Math 1

SECTION 1

Historical Context & Motivation

Sequences — ordered lists of numbers that follow a pattern — have fascinated mathematicians for thousands of years. Long before algebra existed as a formal discipline, ancient civilizations noticed that many real-world phenomena could be described by patterns that repeat in a predictable way. The idea of defining a sequence by explaining how to get from one term to the next is what we now call a recursive rule. This approach turns out to be one of the most natural and powerful ways to describe patterns, and it forms the backbone of modern computing, finance, and scientific modeling.

~1650 BCE • Egyptian Arithmetic Sequences

The Rhind Papyrus contains problems involving arithmetic sequences, showing that Egyptian scribes understood how to distribute quantities in evenly spaced amounts.

~300 BCE • Euclid's Elements

Euclid formalized properties of number sequences and proportions in ancient Greece, laying groundwork for recognizing common differences and ratios.

1202 • Fibonacci's Liber Abaci

Leonardo of Pisa (Fibonacci) published the famous Fibonacci sequence, defined entirely by a recursive rule: each term is the sum of the two preceding terms.

1800s • Formal Recursive Definitions

Mathematicians like Augustus De Morgan and Giuseppe Peano rigorously defined recursion, establishing it as a foundational concept in mathematics and logic.

1930s–Today • Recursion in Computing

Alan Turing and other pioneers of computer science built the concept of recursion into the architecture of programming languages, making recursive thinking essential in technology.

The central question that recursive rules answer is deceptively simple: if you know one term in a sequence, how do you find the next one? Instead of needing a formula that jumps directly to any term, a recursive rule says, "Start here, and keep doing this." This step-by-step perspective is not only intuitive — it mirrors how many processes actually unfold in the real world, from calculating monthly savings to tracking population growth.

SECTION 2

Core Principles & Definitions

Before diving into recursive rules, let's nail down the vocabulary. A sequence is an ordered list of numbers, and each number in the list is called a term. We label terms with subscript notation: a₁ is the first term, a₂ is the second, and so on. The general term is written a_n, meaning "the nth term." An arithmetic sequence is a special type of sequence where the difference between consecutive terms is always the same. That constant gap is called the common difference, denoted d.

Recursive Rule

A formula that defines each term of a sequence using the previous term(s). It always requires a starting value (initial condition).

Initial Condition

The first term of the sequence (a₁) that "starts the chain." Without it, the recursive rule cannot produce any values.

Common Difference (d)

The constant value added to each term to get the next. It can be positive, negative, or zero.

Explicit vs. Recursive

An explicit rule lets you find any term directly (a_n = a₁ + (n−1)d). A recursive rule builds term-by-term from the previous term.

✦

KEY TAKEAWAY

Think of a recursive rule like giving someone driving directions one turn at a time. Instead of saying "The destination is at 42.3° N, 71.1° W" (an explicit address), you say "Start at the school, drive 2 miles, then turn right." Each instruction depends on where you are right now. A recursive rule works the same way: it tells you how to get from where you are (the current term) to the next term.

SECTION 3

Visual Explanation

The diagram below shows the arithmetic sequence 3, 7, 11, 15, 19 plotted on a number line and as a step-by-step chain. Each arrow represents the action of the recursive rule: adding the common difference d = 4 to the previous term. Notice how every step is the same size — that's what makes the sequence arithmetic.

Top: the term chain shows each term produced by adding d = 4 to the previous term. Middle: the same terms plotted on a number line with equal-sized arcs. Bottom: when plotted as (n, a_n) points, an arithmetic sequence always forms a straight line.

There are three key observations in this diagram. First, in the chain view at the top, every arrow carries the same label (+4), which visually confirms the common difference. Second, on the number line, the equal spacing between dots shows that arithmetic sequences spread their terms out evenly. Third, the scatter plot at the bottom reveals that when you plot term number on the horizontal axis and term value on the vertical axis, an arithmetic sequence always produces points that lie on a straight line. The slope of that line equals the common difference.

SECTION 4

Mathematical Framework

A recursive rule for an arithmetic sequence has two parts that must always be stated together. The first part is the initial condition — it tells you where the sequence begins. The second part is the recursive formula — it tells you how to get from any term to the next. Without both pieces, the rule is incomplete.

RECURSIVE RULE FOR AN ARITHMETIC SEQUENCE

a₁ = (first term) ; aₙ = aₙ₋₁ + d, for n ≥ 2

a₁ = the first term (initial condition). a_n = the nth term. a_n−1 = the term immediately before a_n. d = the common difference (added each time).

FINDING THE COMMON DIFFERENCE

d = aₙ − aₙ₋₁

Subtract any term from the term that follows it. If this difference is the same for every pair of consecutive terms, the sequence is arithmetic.

EXPLICIT RULE (FOR COMPARISON)

aₙ = a₁ + (n − 1) × d

This explicit formula lets you jump directly to any term. It is mathematically equivalent to applying the recursive rule (n − 1) times from a₁.

Here is the crucial distinction: the recursive rule a_n = a_n−1 + d looks backward — it defines each term by referencing the one right before it. The explicit rule a_n = a₁ + (n − 1)d skips ahead — it calculates any term from the first term and the position number. Both rules describe the same sequence, but they serve different purposes. When you're generating terms one at a time (as a computer does), the recursive form is natural. When you need, say, the 100th term immediately, the explicit form is more efficient.

SECTION 5

Building Sequences Step by Step

Let's see how a recursive rule actually generates a sequence, and then look at how different values of a₁ and d produce different behaviors. The flowchart below illustrates the process of using a recursive rule to generate as many terms as you want.

This flowchart shows the recursive process: start with a₁, add d to get the next term, and loop until you have as many terms as needed. The loop arrow (YES) feeds back into Step 3.

How Different Values of d Affect the Sequence

Common Difference (d)	Behavior	Example (a₁ = 5)
d > 0 (positive)	Sequence increases	5, 8, 11, 14, 17, … (d = 3)
d < 0 (negative)	Sequence decreases	5, 2, −1, −4, −7, … (d = −3)
d = 0	Constant sequence	5, 5, 5, 5, 5, … (d = 0)

Effect of the common difference on sequence behavior

A positive common difference makes the sequence grow; a negative common difference makes it shrink. If d equals zero, every term is the same as the first, so the sequence is just a constant list. No matter which case you encounter, the recursive structure is identical: you start with a₁ and repeatedly add d.

SECTION 6

Worked Example

Let's work through a complete problem from start to finish. Suppose you are given the arithmetic sequence 10, 6, 2, −2, … and asked to (a) write a recursive rule, (b) find the 6th term using that rule, and (c) verify using the explicit formula.

Writing and Using a Recursive Rule

1
Step 1 — Identify the First Term

The first number listed is 10, so a₁ = 10. This becomes the initial condition of our recursive rule.

a₁ = 10
2
Step 2 — Find the Common Difference

Subtract consecutive terms: 6 − 10 = −4, and 2 − 6 = −4, and −2 − 2 = −4. The difference is the same every time, confirming the sequence is arithmetic with d = −4.

d = −4
3
Step 3 — Write the Recursive Rule

Combine the initial condition and the recursive formula. The rule is: a₁ = 10 and a_n = a_n−1 + (−4), which we can also write as a_n = a_n−1 − 4, for n ≥ 2.

a₁ = 10; aₙ = aₙ₋₁ − 4, n ≥ 2
4
Step 4 — Generate Terms to Find a₆

We already know a₁ = 10, a₂ = 6, a₃ = 2, a₄ = −2. Continuing: a₅ = a₄ + (−4) = −2 + (−4) = −6. Then a₆ = a₅ + (−4) = −6 + (−4) = −10.

a₆ = −10
5
Step 5 — Verify with the Explicit Formula

Using a_n = a₁ + (n − 1)d, we get a₆ = 10 + (6 − 1)(−4) = 10 + 5(−4) = 10 − 20 = −10. This matches our recursive result, confirming both methods give the same answer.

Verified: a₆ = −10 ✓

SECTION 7

Recursive vs. Explicit — Strengths & Limitations

Both recursive and explicit rules describe the same arithmetic sequence, so why do we need both? Each form has clear strengths and weaknesses, and understanding when to use each is an important algebraic skill.

Feature	Recursive Rule	Explicit Rule
Form	a₁ = __; aₙ = aₙ₋₁ + d	aₙ = a₁ + (n − 1)d
Finding the next term	Very easy — just add d	Must plug in n + 1
Finding a distant term (e.g., a₁₀₀)	Tedious — need all 99 prior terms	Instant — one calculation
Emphasizes	The process (how the sequence grows)	The result (position → value)
Connection to graphing	Highlights slope as repeated addition	Resembles y = mx + b directly
Use in programming	Natural for loops and iteration	Better for direct computation

Comparison of recursive and explicit rules for arithmetic sequences

✦

KEY TAKEAWAY

Think of it like two ways to describe a staircase. The recursive rule says, "Each step is 7 inches above the previous step." The explicit rule says, "Step number n is at a height of 7n inches." Both are correct descriptions of the same staircase, but you'd use the first if you're climbing step by step and the second if someone asks, "How high is step 50?"

SECTION 8

Connection to Advanced Topics

The recursive thinking you develop with arithmetic sequences is a stepping stone to much more advanced mathematics. In later courses, you'll encounter geometric sequences, where you multiply by a constant ratio instead of adding a constant difference, and even sequences defined by more complex recursive rules that reference multiple previous terms (like the Fibonacci sequence). Recursion is also the foundation of mathematical induction, a powerful proof technique used throughout higher math.

Concept You Know Now	Where It Leads
Recursive rule: aₙ = aₙ₋₁ + d	Geometric sequences: aₙ = aₙ₋₁ × r (multiply by a ratio)
Common difference d	Slope in linear functions y = mx + b
Generating terms step by step	Iteration and loops in computer programming
Sequences with initial conditions	Differential equations with initial values (calculus)

How recursive rules connect to future math topics

One especially elegant connection is between arithmetic sequences and linear functions. The explicit rule a_n = a₁ + (n − 1)d can be rewritten as a_n = d × n + (a₁ − d), which has exactly the same structure as y = mx + b. The common difference d plays the role of slope, and (a₁ − d) plays the role of the y-intercept. So every arithmetic sequence is really a linear function restricted to positive integer inputs. This is why the scatter plot in Section 3 formed a straight line.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

Explain in your own words why a recursive rule for an arithmetic sequence needs both an initial condition (a₁) and a recursive formula (a_n = a_n−1 + d). What would happen if you only had one of these two pieces?

Show answer

The recursive formula tells you how to move from one term to the next (the rule), but it doesn't tell you where to start. Without the initial condition, you could produce infinitely many different sequences — for example, a_n = a_n−1 + 3 could start at 1 (giving 1, 4, 7, …) or at 100 (giving 100, 103, 106, …). Conversely, if you only have a₁ = 5 but no formula, you know the starting point but have no instructions for generating additional terms. Both pieces are essential: the initial condition anchors the sequence, and the formula drives it forward.

Question 2: BASIC CALCULATION

Write a recursive rule for the arithmetic sequence 4, 11, 18, 25, 32, … Then use your rule to find a₆.

Show answer

First, identify a₁ = 4. Next, find d by subtracting consecutive terms: 11 − 4 = 7, 18 − 11 = 7, so d = 7. The recursive rule is a₁ = 4; a_n = a_n−1 + 7, for n ≥ 2. To find a₆: a₅ = 32 (given), so a₆ = 32 + 7 = 39.

Question 3: INTERMEDIATE

An arithmetic sequence has a₃ = 14 and a₇ = 30. Find the common difference d, then write the recursive rule (including a₁).

Show answer

From a₃ to a₇ is 4 steps, so 4d = a₇ − a₃ = 30 − 14 = 16, giving d = 4. Now work backward to find a₁: a₂ = a₃ − d = 14 − 4 = 10, and a₁ = a₂ − d = 10 − 4 = 6. The recursive rule is a₁ = 6; a_n = a_n−1 + 4, for n ≥ 2. You can verify: 6, 10, 14, 18, 22, 26, 30 — a₃ = 14 ✓ and a₇ = 30 ✓.

Question 4: APPLIED

A student saves money each week. In week 1, she has $50 in savings. Each subsequent week, she adds $15 to her savings. Write a recursive rule to model her total savings a_n after week n. How much has she saved after 10 weeks?

Show answer

This is an arithmetic sequence where a₁ = 50 (initial savings) and d = 15 (weekly addition). The recursive rule is a₁ = 50; a_n = a_n−1 + 15, for n ≥ 2. To find a₁₀ efficiently, use the explicit form: a₁₀ = 50 + (10 − 1) × 15 = 50 + 135 = $185. After 10 weeks, she has $185 in savings. The recursive approach is natural for tracking week-by-week progress, while the explicit form lets us jump to week 10 directly.

Question 5: CRITICAL THINKING

Marcus claims that the sequence defined by a₁ = 100 and a_n = a_n−1 − 7 will eventually include the term 0. Is Marcus correct? Justify your answer using both the recursive rule and the explicit formula. If 0 is not a term, identify the two consecutive terms it falls between.

Show answer

Using the explicit formula: a_n = 100 + (n − 1)(−7) = 107 − 7n. Setting 107 − 7n = 0 gives n = 107/7 ≈ 15.29. Since n must be a positive integer, there is no term equal to 0. Marcus is incorrect. The 15th term is a₁₅ = 107 − 7(15) = 107 − 105 = 2, and the 16th term is a₁₆ = 107 − 7(16) = 107 − 112 = −5. So 0 falls between a₁₅ = 2 and a₁₆ = −5. The recursive rule confirms this: …, 9, 2, −5, … — each term drops by 7, and the sequence skips over 0.

SUMMARY

Lesson Summary

Summary

A recursive rule for an arithmetic sequence has two essential parts: an initial condition (a₁) that sets the starting value, and a recursive formula (aₙ = aₙ₋₁ + d) that tells you how to get each term from the previous one. The constant value d is the common difference, and it can be positive (increasing sequence), negative (decreasing sequence), or zero (constant sequence).

While the explicit rule (aₙ = a₁ + (n − 1)d) lets you jump directly to any term, the recursive rule emphasizes the step-by-step process of building a sequence. Understanding both representations — and knowing when each is most useful — is key to working fluently with sequences. The common difference in an arithmetic sequence corresponds to the slope of a linear function, linking sequences directly to the broader study of algebra and functions.