|
%I #6 Dec 18 2015 18:18:30
%S 6,52,2280,405988,329268616,1079538816324,16086247351158920,
%T 968803030037550870052,265167552942550197086665096,
%U 293336730456466043837816011720516
%N 3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of n X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Diagonal of A223352
%H R. H. Hardin, <a href="/A223345/b223345.txt">Table of n, a(n) for n = 1..15</a>
%e Some solutions for n=3
%e ..4..1..3....1..4..2....4..1..3....1..0..2....0..2..0....1..4..1....5..2..5
%e ..1..3..1....0..2..5....2..4..1....0..2..5....2..5..2....0..1..4....2..5..2
%e ..3..1..4....1..0..2....5..2..0....1..0..2....0..2..5....2..0..1....4..2..4
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 19 2013
| 