A223444 - OEIS

A223444

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

66, 408, 2988, 20640, 149120, 1050624, 7557696, 53547904, 384685440, 2730236928, 19605861888, 139221963776, 999628996096, 7099542437888, 50973532015616, 362040887361536, 2599362561034240, 18462321529880576, 132554347340582912

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

OFFSET

1,1

COMMENTS

Column 3 of A223449

LINKS

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

FORMULA

Empirical: a(n) = 70*a(n-2) -1024*a(n-4) +2832*a(n-6) -1792*a(n-8) +128*a(n-10)

EXAMPLE

Some solutions for n=3

.10..2.10....2.10..2....2..0..2....0..1..0....5..3..5...10.14.10....5..3..6