|
A223431
|
|
5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX7 0..14 arrays where 0..14 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 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
|
|
1
|
|
|
%I
%S 10052,3613024,1575629948,707293805988,325249041493488,
%T 149616234350273816,69480486701806161900,32146056288289912125792,
%U 14967181981562004391914308,6936817035714720741320651808
%N 5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX7 0..14 arrays where 0..14 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 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Column 7 of A223432
%H R. H. Hardin, <a href="/A223431/b223431.txt">Table of n, a(n) for n = 1..147</a>
%e Some solutions for n=3
%e ..0..1..3..1..0..1..4....0..1..3..1..4..7..4....0..1..3..1..3..6..3
%e ..1..0..1..0..1..4..8....1..0..1..4..7.12..7....1..0..1..3..7..3..7
%e ..0..1..0..2..4..2..4....0..1..0..2..4..7.11....0..1..0..1..3..7..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 20 2013
|
