Each successive sum is one less than a Fibonacci number. It’s possible to use square and domino tilings to prove combinatorially that the sum of the first n Fibonacci numbers equals F n +2 – 1.

Though the Fibonacci sequence shows up everywhere in nature, these young mathematicians were surprised to find it in the answer to a variation of the pick-up sticks problem⁠—a nearly two-century-old f ...