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

1, 19, 1519, 426359, 515473927, 2519813048575, 51596648899152901, 4382197669772597921079, 1555039484181265199709474223, 2303272223887812126256525632339813

Offset: 1

Author

R. H. Hardin, Mar 21 2013

Keywords

• nonn

Comments

Diagonal of A223504.

Examples

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

Crossrefs

Cf. A223504.