A223416 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

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

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