login
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
1

%I #6 Dec 18 2015 18:18:30

%S 7,40,868,47872,9210784,4565849088,7939011165696,35771349106229248,

%T 568805952799804981248,23519412222495212487835648,

%U 3445579826336104496385828585472,1315514651265664243430976739562487808

%N 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

%C Diagonal of A223423

%H R. H. Hardin, <a href="/A223416/b223416.txt">Table of n, a(n) for n = 1..16</a>

%e Some solutions for n=3

%e ..3..1..3....5..2..0....6..2..0....2..0..1....4..1..3....4..1..4....4..1..3

%e ..1..0..1....2..6..2....2..6..2....0..1..0....1..0..1....1..4..1....1..3..1

%e ..3..1..3....0..2..6....5..2..6....1..0..1....3..1..0....3..1..3....0..1..3

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 20 2013