Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/VertexColoring.html">Vertex Coloring</a>
Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/VertexColoring.html">Vertex Coloring</a>
Andrew Howroyd, <a href="/A222444/b222444_1.txt">Table of n, a(n) for n = 1..496</a> (terms 1..180 from R. H. Hardin)
reviewed
approved
proposed
reviewed
editing
proposed
T(n,k) =Number number of nXk n X k 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.
k=3: a(n) = 18*a(n-1) - 27*a(n-2).
k=4: a(n) = 45*a(n-1) - 267*a(n-2) + 263*a(n-3).
k=5: a(n) = 118*a(n-1) - 2811*a(n-2) + 22255*a(n-3) - 53860*a(n-4) - 54747*a(n-5) + 269406*a(n-6) - 175392*a(n-7).
Some solutions for n=3 , k=4:
proposed
editing
editing
proposed
editing
proposed