Find the number of ways to tile a $2 \times 6$ grid board with the following 2 types of dominoes - (i) A $2×1$ black dominoes (ii) A $2×2$ red dominoes
Here's how i though of this - It is trivial to see a tiling $2×2$ domino can also be done using $2$ $2×1$ dominoes, and number of $2×1$ dominoes must be even on either row or the column of the board (as on the contrary we caannot tile using 2×2$).
I need help after this thanks!
Let $f(n)$ represent the number of ways to tile a $2\times n$ grid. If $n$ is sufficiently large, the right hand column can be filled in one of three ways.
Therefore, if $n\ge2$, we have $f(n)=f(n-1)+2f(n-2)$. Adding in that $f(0)=f(1)=1$, we can calculate out that $f(6)=43$.