Counting & Probability · Medium problem

Let $T_n$ be the number of ways to tile a $2 \times n$ board completely with $1 \times 2$ dominoes. Given $T_1 = 1$ and $T_2 = 2$, find $T_4$.