|
%I #4 Mar 18 2013 17:48:53
%S 6528,2523798,1160465118,531419938920,247143798101322,
%T 114951289224812310,53598993642186546600,24992288357276722268070,
%U 11658720331222331821271670,5438674473932192381017144224,2537301177538849145899098252090
%N 3X3X3 triangular graph coloring a rectangular array: number of nX7 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Column 7 of A223218
%H R. H. Hardin, <a href="/A223217/b223217.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..1..0..2..4..1..4....0..1..0..1..4..2..4....0..1..0..2..4..2..1
%e ..1..0..2..4..3..4..3....1..0..1..0..2..1..2....1..0..2..4..2..0..2
%e ..0..1..0..1..4..2..4....0..1..0..2..0..2..0....0..1..0..1..4..1..4
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 18 2013
| 