A223416 3-level binary fanout graph coloring a rectangular array: number of n X n 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph

7, 40, 868, 47872, 9210784, 4565849088, 7939011165696, 35771349106229248, 568805952799804981248, 23519412222495212487835648, 3445579826336104496385828585472, 1315514651265664243430976739562487808

Offset

1,1

Comments

Diagonal of A223423

Links

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

Example

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

Crossrefs

Sequence in context: A226223 A356046 A062727 * A165397 A123747 A144421

Adjacent sequences: A223413 A223414 A223415 * A223417 A223418 A223419

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved