Counting & Probability · Medium problem

Let $t_n$ be the number of ways to tile a $1 \times n$ strip using tiles of length $1$, $2$, or $3$. Write the recurrence for $t_n$ and use it to find $t_6$. Take $t_0 = 1$.