login
A223430
5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX6 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
3276, 524736, 98783592, 19187276496, 3786278496752, 751323264058296, 149616234350273816, 29839681026865862852, 5957403703829431081880, 1189965844947678466659160, 237769159273718477039498984
OFFSET
1,1
COMMENTS
Column 6 of A223432
LINKS
EXAMPLE
Some solutions for n=3
..0..1..4..1..4..1....0..1..3..7..4..8....0..1..0..2..4..8....0..1..4..7..4..7
..1..0..1..3..7..3....1..0..1..4..7.12....1..0..2..4..2..5....1..0..1..3..7.11
..0..1..0..1..4..1....0..2..4..1..3..7....0..2..5..8..5..8....0..1..3..6..3..6
CROSSREFS
Sequence in context: A353140 A237085 A260410 * A307767 A307809 A141629
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 20 2013
STATUS
approved