Question 62
Let $n \geq 3$ be a natural number. We want to write one of the numbers $1,2$ or $3$ in each cell of an $n \times n$ table so that any three cells that can be covered by a domino of the shape $\square\square\square$ (the domino may also be rotated) contain different numbers. In how many ways can this be done?