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.

The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones. It is closely related to the golden ratio, which appears in various natural and artistic contexts.