|
%I #4 Mar 19 2013 18:16:56
%S 16488,6985008,3445747472,1770698081072,924127826390176,
%T 485449397967176280,255768507759156858992,134949783828939584120672,
%U 71254070803235893596880736,37636402829217559686241021952
%N 4X4 square grid graph coloring a rectangular array: number of nX7 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Column 7 of A223402
%H R. H. Hardin, <a href="/A223401/b223401.txt">Table of n, a(n) for n = 1..109</a>
%e Some solutions for n=3
%e ..4..0..1..5..1..0..4....4..0..1..5..1..5..9....4..0..1..5..6.10..6
%e ..0..1..2..1..5..4..5....0..1..2..1..0..1..5....0..1..2..6..5..9..5
%e ..4..0..1..5..4..8..4....4..0..1..2..1..0..4....4..0..1..5..9..5..9
%e Vertex neighbors:
%e 0 -> 1 4
%e 1 -> 0 2 5
%e 2 -> 1 3 6
%e 3 -> 2 7
%e 4 -> 0 5 8
%e 5 -> 4 1 6 9
%e 6 -> 5 2 7 10
%e 7 -> 6 3 11
%e 8 -> 4 9 12
%e 9 -> 8 5 10 13
%e 10 -> 9 6 11 14
%e 11 -> 10 7 15
%e 12 -> 8 13
%e 13 -> 12 9 14
%e 14 -> 13 10 15
%e 15 -> 14 11
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 19 2013
| 