Number of ways of n-coloring the square grid graph G_(3,3) such that no rectangle exists with sides parallel to the axes having all 4 corners of the same color.

A252778

Number of ways of n-coloring the square grid graph G_(3,3) such that no rectangle exists with sides parallel to the axes having all 4 corners of the same color.

Terms

    a(0) =0a(1) =0a(2) =156a(3) =14298a(4) =228984a(5) =1821420a(6) =9676020a(7) =39328086a(8) =131914608a(9) =382726584a(10) =991134540a(11) =2342199090a(12) =5133181416a(13) =10561434468a(14) =20593784484a(15) =38341504110a(16) =68569332960a(17) =118371718896a(18) =198054533628a(19) =322265959434a(20) =511426049880a(21) =793510636380

External references