Sequences from patterns – difference tables, the nth term and recurrence relations

MathematicsSequences & Financial MathAges 16–17

Use with my class

Grow matchstick, tile and cube patterns, record the terms in a table and plot them. Use first, second and third differences to find the nth term of linear (an + b), quadratic and cubic sequences, check whether a number is a term, and compare with geometric and Fibonacci-type sequences. The Recurrence screen iterates uₙ₊₁ = f(uₙ) on a cobweb diagram to show increasing, decreasing, convergent and periodic sequences, and adds the first N terms in sigma notation. The Special sums screen proves 1 + 2 + … + n = n(n + 1)/2 with a staircase of blocks, 1² + … + n² = n(n + 1)(2n + 1)/6 with three stepped pyramids of cubes, and 1³ + … + n³ = (1 + … + n)² with the Nicomachus square, in 2D or with 3D blocks, and checks each formula for a chosen n. The Lucas's tower screen lets students move 1 to 8 discs by the rules, compares their moves with the fewest possible and solves the recurrence Tₙ = 2Tₙ₋₁ + 1 to Tₙ = 2ⁿ − 1 with the powers of 2.

Lesson: Sequences: the nth term from patterns, the method of differences, recurrence relations, increasing, decreasing and periodic sequences, sigma notation, Lucas's tower and the recurrence Tₙ = 2Tₙ₋₁ + 1

What it shows

A sequence can be given by a position-to-term rule (the nth term uₙ) or by a recurrence relation. The method of differences finds the nth term: constant first, second or third differences give a linear, quadratic or cubic sequence. The Recurrence screen iterates uₙ₊₁ = f(uₙ) on a cobweb diagram and adds terms in sigma notation. The Special sums screen shows with blocks why the sums of k, k² and k³ follow their formulas. In Lucas's tower, n discs need Tₙ = 2Tₙ₋₁ + 1 moves at least; Tₙ + 1 doubles each time, so Tₙ = 2ⁿ − 1.

How to use

Choose a Pattern and press Add next pattern, or untick Show differences and nth term and work them out first. On Recurrence and sums, choose a Recurrence and move a, b, u₁ and N. On Special sums, pick Σk, Σk² or Σk³, set n, switch between 2D drawing and 3D blocks and press Record. On Lucas's tower, set Discs n, tap a peg to lift its top disc and another peg to put it down, or press Best next move or Shortest solution.

Parameters you can change

  • Screen Patterns and the nth term, Recurrence relations and sums, Special sums Σk, Σk², Σk³, Lucas's tower
  • Pattern Matchstick squares, Matchstick triangles, Staircase of tiles, n × n matchstick grid, n × n × n cube, Sierpiński triangle, Fibonacci squares, Your own sequence
  • Number of patterns (terms) 4–8 patterns
  • Your own sequence (numbers separated by commas)
  • Show the differences and the nth term
  • Recurrence relation uₙ₊₁ = a·uₙ + b, uₙ₊₁ = 1 − 1/uₙ (periodic), uₙ₊₂ = uₙ₊₁ + uₙ (Fibonacci-type)
  • Coefficient a in uₙ₊₁ = a·uₙ + b -2–2
  • Constant b in uₙ₊₁ = a·uₙ + b -10–10
  • First term u₁ -10–20
  • Second term u₂ (Fibonacci-type) -10–20
  • Number of terms added N 1–20 terms
  • Special sum (Special sums screen) 1 + 2 + … + n, 1² + 2² + … + n², 1³ + 2³ + … + n³
  • Number of terms n (Special sums screen) 1–12
  • View (Special sums screen) 2D drawing, 3D blocks
  • Pull the pieces apart (Special sums screen)
  • Number of discs (Lucas's tower screen) 1–8

Questions to explore

  1. How many matchsticks are needed for 50 squares in a row, and can exactly 100 matchsticks make a complete pattern?
  2. Why are the second differences of the staircase pattern constant, and what does that tell you about its nth term?
  3. For which values of a does uₙ₊₁ = a·uₙ + b converge, and what is the limit?
  4. Why do three copies of 1² + … + n² fill a rectangle 2n + 1 by 1 + … + n?
  5. Why does Lucas's tower with n discs need 2ⁿ − 1 moves at least?