Topic Guide 02 — Progression & Recurrence

The Next Step in the Sequence

Macro photograph of stamped metal number discs arranged in an ascending curve on dark slate

A sequence challenge presents an ordered list of numbers or symbols and asks you to deduce the generating law that dictates the next term—or an interior missing term. While casual puzzles rely on obvious constant steps (+5, +5, +5), well-crafted adult sequence challenges draw on finite difference calculus, recurrence relations (popularized in the West by Leonardo of Pisa, known as Fibonacci, in his 1202 Liber Abaci), and structural properties cataloged in Neil Sloane's On-Line Encyclopedia of Integer Sequences (OEIS).

1. Why Well-Designed Sequences Include a Terminal Anchor

Mathematically, through Lagrange polynomial interpolation, any short list of four numbers can be continued by infinitely many valid formulas. For example, the opening terms 1, 2, 4, 8, 16 suggest powers of two (giving 32 next). Yet if those numbers count the maximum regions created by joining n points on a circle with straight chords (Moser's circle problem), the sixth term is strictly 31.

To prevent ambiguity, rigorous puzzle constructors either specify the domain of the rule (e.g., "a two-step arithmetic-geometric recurrence") or provide a terminal anchor—giving you terms 1, 2, 3, 4, [ ? ], and 6 so your candidate rule must successfully bridge both into and out of the gap.

2. The Method of Finite Differences

Whenever a sequence grows smoothly without exploding exponentially, construct a difference triangle by subtracting each term from its successor. If the first row of differences is not constant, take the differences of the differences.

Row Level Term 1 Term 2 Term 3 Term 4 Term 5 Term 6 (Target)
Original Sequence 3 6 14 29 53 88
1st Differences (Δ¹) +3 +8 +15 +24 +35 —
2nd Differences (Δ²) +5 +7 +9 +11 — —
3rd Differences (Δ³) +2 +2 +2 — — —

Here, the third difference is a constant +2. Working upward from the bottom right: add 2 to 9 to get +11 in the second difference row; add 11 to 24 to get +35 in the first difference row (or notice that Δ¹ consists of 2²−1, 3²−1, 4²−1, 5²−1, 6²−1); finally, add 35 to 53 to arrive at 88.

3. Three Classic Structural Traps and How to Spot Them

Practice Challenge: 2, 3, 5, 9, 17, 33, [ ? ] — Compare Two Equivalent Proofs

Proof A (First Differences): The steps between terms are +1, +2, +4, +8, +16. Doubling the step gives +32, so 33 + 32 = 65.

Proof B (Closed Form & Doubling Minus One): Each term is double the previous term minus 1 (2×2−1=3; 3×2−1=5; 33×2−1=65), or equivalently 2ⁿ + 1 for n = 0, 1, 2, 3, 4, 5, 6 (2⁶ + 1 = 65). Verifying that two distinct mental models converge on 65 confirms the rule's integrity.