Patterns beyond the obvious

Start with a testable description

A number pattern is a relationship you propose between terms. Useful proposals are specific: add three, double the previous term, or add the two previous terms. “The numbers grow” is an observation, but it does not tell you what to calculate next.

Begin by numbering the positions. Then compare neighboring terms. Differences help with additive patterns; ratios help with multiplicative ones. If neither seems steady, look at how the differences change. Keep these calculations separate from your conclusion: they are evidence for a rule, not proof that no other rule exists.

Why the triangular formula works

1. Make two copies of the same dot triangle.
2. Turn one copy around and fit them together into a rectangle with n rows and n + 1 columns.
3. The rectangle contains n(n + 1) dots. One triangle has half that number.

This is more than a shortcut. It links an arithmetic sum to an area argument. For younger learners, counters or drawn dots make the pairing visible. For older learners, the picture supports the identity 1 + 2 + … + n = n(n + 1)/2.

Fibonacci: name the starting convention

One common version of the Fibonacci sequence starts 0, 1, 1, 2, 3, 5, 8, 13. Each later term is the sum of the previous two. Another common presentation begins with 1, 1. Both describe the same recurrence with a different starting index, so an explanation should say which convention it uses.

The sequence is associated with Leonardo of Pisa, known as Fibonacci, and his Liber Abaci of 1202. Related counting ideas also have an earlier history in Indian mathematics. Recognizing the name is useful, but you should still check the rule: not every list containing 1, 2 and 3 is a Fibonacci sequence.

Try predicting two terms rather than one. Following 8 and 13, the rule gives 21, then 34. Checking more than one prediction helps expose a rule that happened to fit only the most recent step.

A short sequence is evidence to interpret, not a contract with a single future.

When doubling is not the only answer

For 2, 4, 8, 16, doubling suggests 32. Now number the terms starting at n = 1 and consider the alternative rule:

a(n) = 2ⁿ + (n − 1)(n − 2)(n − 3)(n − 4)

For each of the first four positions, one factor in the product is zero. The added part therefore vanishes, preserving all four displayed terms. At n = 5, it adds 24 to 32, producing 56. This is a deliberately constructed alternative, not a claim that 56 is the most natural classroom answer.

The lesson is to distinguish simplicity from certainty. A puzzle may ask for the simplest conventional rule, provide a generating formula, or define a real counting situation. Those extra instructions narrow the possibilities. Without them, say “one plausible continuation” rather than “the only possible answer.”

A practical investigation routine

Write your candidate rule in one sentence. Check every given term, including the first. Predict another term. Finally, ask what evidence would disprove your proposal. This small routine prevents a common wrong turn: noticing a relationship near the end and silently ignoring a term that does not fit.

Pascal’s triangle offers a different structure to explore: edge entries are 1, and each interior entry is the sum of the two directly above it. Its rows connect to binomial coefficients, while diagonal sums connect to Fibonacci numbers. Square numbers and powers of two are useful comparison sequences because their differences behave differently.

The On-Line Encyclopedia of Integer Sequences, founded by Neil Sloane, is a reference for known integer sequences. Search results can suggest connections; they do not establish which rule a particular puzzle intended.

Next, test assumptions in a logic puzzle, where the challenge shifts from predicting a rule to following explicit constraints.