A223561 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 or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.

7776, 177147, 22284891, 2960456193, 414863325945, 59043582882099, 8468395670690901, 1218666102798243879, 175642608583999726713, 25331295128141837865681, 3654268425473611746796515

Offset: 1

Author

R. H. Hardin Mar 22 2013

Keywords

• nonn

Comments

Row 6 of A223556

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..3..0....0..1..0....0..3..0....0..3..0....0..3..0....0..3..0....0..1..0
..0..1..0....0..2..1....0..3..5....0..3..4....0..1..2....0..1..4....0..1..0
..0..1..0....0..2..0....0..3..0....0..3..4....2..0..2....2..1..0....2..1..0
..0..1..4....0..3..4....0..3..0....4..3..5....2..5..3....0..2..0....0..2..0
..2..5..3....0..3..0....5..2..1....5..4..1....3..4..3....0..3..0....0..2..5
		

Links

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