A223509 Petersen graph (3,1) coloring a rectangular array: number of 6Xn 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.

7776, 31307, 3528715, 291545903, 27465794119, 2519813048575, 234215122981463, 21722081604000233, 2017473470471496373, 187345647840479535879, 17400111813793245517801, 1616059549379820468437485

Offset: 1

Author

R. H. Hardin Mar 21 2013

Keywords

• nonn

Comments

Row 6 of A223504

Examples

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

Links

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