|
A223429
|
|
5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX5 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 #4 Mar 20 2013 05:46:44
%S 1088,76384,6256832,522011152,44494633876,3786278496752,
%T 325249041493488,27818291732538560,2394866308625232348,
%U 205161525882369203816,17674243382606574047928,1514928267584528501654120
%N 5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX5 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 5 of A223432
%H R. H. Hardin, <a href="/A223429/b223429.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..1..4..1..3....0..1..4..7..3....0..1..4..7..3....0..1..4..8..4
%e ..1..3..1..3..6....1..4..7..4..1....1..3..7.12..7....1..0..1..4..1
%e ..0..1..3..6.11....4..7.12..7..4....4..7.12..7.12....3..1..3..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 20 2013
|
