Pavers

This problem asks us the number of ways we can tile a 2xN grid with up to 3-ominos.

This is a pretty common/standard DP problem that's given away by the fact that one of the dimensions is fixed and small. See Tray Bien For more details. In this case we have only 4 possible fronts instead of the 8 listed there.