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

1752, 102528, 7557696, 553773760, 42196917280, 3173584196608, 242750087582720, 18355130761851904, 1404211778503671808, 106325547561713332224, 8132796906906251831296, 616068752536307030687744

Offset

1,1

Comments

Column 7 of A223449.

Links

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

Example

Some solutions for n=3
..0..1..3..5..3..1..4....0..1..3..1..0..1..4....0..1..4..1..0..1..4
..1..0..1..3..1..4..8....1..3..1..0..1..3..1....1..3..1..3..1..3..1
..0..2..0..1..0..1..4....0..1..0..1..3..5..3....0..1..0..1..4..1..4

Crossrefs

Cf. A223449.

Sequence in context: A251892 A143994 A157325 * A102327 A076809 A272326

Adjacent sequences: A223445 A223446 A223447 * A223449 A223450 A223451

Keyword

nonn

Author

R. H. Hardin, Mar 20 2013

Status

approved