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.