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.

A252779

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.

Terms

    a(0) =0a(1) =0a(2) =144a(3) =13932a(4) =226224a(5) =1809360a(6) =9637200a(7) =39225564a(8) =131679072a(9) =382238784a(10) =990202320a(11) =2340528300a(12) =5130339984a(13) =10556808912a(14) =20586528144a(15) =38330476380a(16) =68553028800a(17) =118348187904a(18) =198021287952a(19) =322219869804a(20) =511363229040a(21) =793426309200

External references