A223340 - OEIS

A223340

5 X 5 X 5 triangular graph coloring a rectangular array: number of n X 4 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

1176, 74736, 5514360, 419434596, 32292951660, 2496237714588, 193291992449808, 14976739459479096, 1160751100183303776, 89971810635836546940, 6974179289949521675220, 540614061842686958224452

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Column 4 of A223344.

LINKS

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

EXAMPLE

Some solutions for n=3

..7..3..4..8....7..3..4..8....7..3..1..4....7.12..7.12....7..3..7..8

..3..4..1..4....3..7..3..7....3..7..3..1....3..7..8.13....3..7..6..7

..6..7..3..1....7..3..7..6....7..3..4..3....7..4..5..9....7.11..7..8