login
A223464
6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX5 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
1946, 150952, 13504044, 1239353252, 116111266332, 10911947024556, 1033873786631384, 97908623437928996, 9316198773171608432, 885092803385071530352, 84374883983760113478652, 8027901201125157294350680
OFFSET
1,1
COMMENTS
Column 5 of A223467
LINKS
EXAMPLE
Some solutions for n=3
..0..1..4..8.12....0..1..4..8.12....0..1..3..7..3....0..1..3..1..0
..1..3..7.12.17....1..4..8..5..8....1..4..7.12..7....1..4..1..0..2
..4..7.12.18.12....4..8.13..9..5....4..1..4..7.12....4..2..4..2..5
CROSSREFS
Sequence in context: A300199 A252151 A235003 * A252062 A251843 A249202
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 20 2013
STATUS
approved