|
%I #4 Mar 20 2013 05:06:47
%S 1312,169124,25615364,3940419696,612911291636,95513129162264,
%T 14904204066672312,2326349099057774436,363184176411838010916,
%U 56702240837550840861524,8852941775002134479343440
%N 4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nX6 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Column 6 of A223415
%H R. H. Hardin, <a href="/A223413/b223413.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..1..0..2..0..1....0..1..4..2..0..2....0..1..4..8..5..2....0..1..0..1..0..1
%e ..1..4..2..5..2..0....1..0..1..0..2..5....1..0..2..4..2..4....1..0..1..0..1..4
%e ..0..2..0..2..4..2....0..2..0..1..4..8....0..1..4..2..5..2....0..2..4..2..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 20 2013
| 