A223503 Petersen graph (3,1) coloring a rectangular array: number of nX7 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.

729, 110427, 22598167, 4867038759, 1065016901935, 234215122981463, 51596648899152901, 11373354088592222347, 2507537188605388269479, 552889843504513864372699, 121910555703890549598868125

Offset: 1

Author

R. H. Hardin Mar 21 2013

Keywords

• nonn

Comments

Column 7 of A223504

Examples

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

Links

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