Domino tilingsStrips up to 8 long
Count the ways to tile a 2-by-n strip with dominoes, and show why it is not a power of two.
Cover a strip two squares wide and n long with dominoes, and count the ways. It starts 1, then 2 — so three columns give 4, surely? Three give 3. The counts are the Fibonacci numbers, and the reason is one look at the last column.

The answer key prints on a separate page.
Look at the last column of the strip. Either a single domino stands upright and fills it, leaving a strip one shorter, or two dominoes lie flat across the last two columns, leaving a strip two shorter. Every tiling is exactly one of those, so the number of ways for length n is the ways for n−1 plus the ways for n−2 — the Fibonacci recurrence. The counts run 1, 2, 3, 5, 8, 13, and being wrong first is the lesson: 1, 2 looks like the start of doubling, and it is not.
The tempting answer is 2 to a power, as if each column were an independent choice. It is not, and the case-split shows exactly why: a flat domino spends two columns at once, so choosing what happens at the last column already decides part of the column before it. That single dependency is what turns doubling into the slower Fibonacci climb, and seeing it is worth more than the sequence.