We want to colour all the squares of an nxn board of red or black. The colorations should be such that any subsquare of 2x2 of the board have exactly two squares of each color. If n≥2 how many such colorations are possible? combinatorics unsolvedcombinatorics