|
A223463
|
|
6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX4 0..20 arrays where 0..20 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 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
|
|
1
|
|
|
%I #4 Mar 20 2013 08:13:57
%S 600,20588,789796,31075684,1239353252,49754342824,2005957755820,
%T 81082814719516,3283105035003140,133083400954907428,
%U 5398712599231655976,219116134683255389256,8896250767631907738132,361277018676277740943780
%N 6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX4 0..20 arrays where 0..20 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 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Column 4 of A223467
%H R. H. Hardin, <a href="/A223463/b223463.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..1..4..2..5....1..4..7.11....1..0..2..0...10..6.11..7....1..4..7..3
%e ..3..7..4..8....4..7.12..7....0..1..4..2....6..3..7..4....3..7..3..1
%e ..1..4..8..4....7..3..7..4....2..0..2..5...11..7.11..7....7.12..7..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 20 2013
|
