A223510 - OEIS

A223510

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

46656, 199497, 46737819, 7624417031, 1463848507173, 272386213374733, 51596648899152901, 9751020046348716929, 1847009269923130289513, 349837085675513092679371, 66283942985024283877005239

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Row 7 of A223504

LINKS

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

EXAMPLE

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

..0..2..0....1..2..5....0..1..4....4..3..4....2..1..4....0..3..0....4..1..4