A223343 - OEIS

A223343

5X5X5 triangular graph coloring a rectangular array: number of nX7 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

106560, 106904016, 138947808456, 193291992449808, 277054255741556856, 401058585082703800512, 583604491391809096656324, 850485672767214270573728268, 1240731947888264978798585678280

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

OFFSET

1,1

COMMENTS

Column 7 of A223344

LINKS

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

EXAMPLE

Some solutions for n=3

..7..3..1..0..1..0..1....7..3..1..4..7..4..5....7..3..1..4..5..4..8

..3..1..0..2..0..2..0....3..1..0..2..4..7..4....3..1..0..1..4..8..4

..1..0..1..0..2..4..1....1..0..1..0..1..4..1....1..0..1..0..1..4..8