A223441 4-level binary fanout graph coloring a rectangular array: number of n X n 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

15, 104, 2988, 262368, 78731136, 75601620736, 242750087582720, 2529851595786153984, 87870306455802168307712, 9952833093128726406499139584, 3754882287727806523042164409106432

Offset

1,1

Comments

Diagonal of A223449

Links

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

Example

Some solutions for n=3
.13.10..2....0..2..9....3..1..0...13.10.13....7..4..8....2..9..2...12..9.11
.10.13.10....2..0..2....1..0..1...10.14.10....4..7..4...10..2..9....9.11..9
..2.10.14...10..2..9....4..1..4....2.10.13....1..4..7...14.10..2...11..9..2

Crossrefs

Sequence in context: A219624 A219170 A227331 * A300295 A102791 A335672

Adjacent sequences: A223438 A223439 A223440 * A223442 A223443 A223444

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved