Question 68
Let $n \geq 2$ be a natural number. Katja wants to color each cell of an $n \times n$ table either black or green so that among any four cells that can be covered by a tile in the shape of a $2 \times 2$ square, an odd number of cells are black. In how many ways can she do this?