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

1088, 76384, 6256832, 522011152, 44494633876, 3786278496752, 325249041493488, 27818291732538560, 2394866308625232348, 205161525882369203816, 17674243382606574047928, 1514928267584528501654120

Offset

1,1

Comments

Column 5 of A223432

Links

R. H. Hardin, Table of n, a(n) for n = 1..210

Example

Some solutions for n=3
..0..1..4..1..3....0..1..4..7..3....0..1..4..7..3....0..1..4..8..4
..1..3..1..3..6....1..4..7..4..1....1..3..7.12..7....1..0..1..4..1
..0..1..3..6.11....4..7.12..7..4....4..7.12..7.12....3..1..3..1..0

Crossrefs

Sequence in context: A206630 A191944 A157256 * A168661 A175698 A110819

Adjacent sequences: A223426 A223427 A223428 * A223430 A223431 A223432

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved