Consider a rectangular table 2×n. Let every cell be dyed either by black or white color in a way that no 2×2 square is completely black. Denote Pn the number of such colorings. Prove that the number P1989 is divisible by three and find the greatest power of three that divides them. combinatoricscombinatorial geometryColoring