Consider a grid of squares that is 2 squares wide and n squares long. Using n dominoes that are 1 square by
2 squares, there are many ways to perfectly cover this grid with no overlap. How many? Prove your answer.

Use of strong induction is advised.