A223420 3-level binary fanout graph coloring a rectangular array: number of nX5 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.

104, 1584, 29912, 486016, 9210784, 150006016, 2844612736, 46345527296, 878977950208, 14321836797952, 271631946213376, 4425979070611456, 83944852851777536, 1367805247361974272, 25942363680265961472

Offset: 1

Author

R. H. Hardin Mar 20 2013

Keywords

• nonn

Comments

Column 5 of A223423

Examples

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

Links

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

Formula

Empirical: a(n) = 392*a(n-2) -26768*a(n-4) +353408*a(n-6) -1274624*a(n-8) +1441792*a(n-10) -307200*a(n-12) for n>13