131679072

Appears in sequences

• Number of ways of n-coloring the square grid graph G_(3,3) such that no rectangle exists having all 4 corners of the same color.at n=8A252779