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

243, 44217, 8410671, 1609602003, 308267930115, 59043582882099, 11308909481307639, 2166053304537606339, 414875312906229086427, 79463200007529976606227, 15219994937262513427990431

Offset

1,1

Comments

Column 6 of A223556

Links

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

Formula

Empirical: a(n) = 229*a(n-1) -7630*a(n-2) +89386*a(n-3) -465129*a(n-4) +1124537*a(n-5) -1178896*a(n-6) +505856*a(n-7) -65536*a(n-8) for n>9

Example

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

Crossrefs

Sequence in context: A222167 A016889 A215044 * A222442 A228975 A016949

Adjacent sequences: A223551 A223552 A223553 * A223555 A223556 A223557

Keyword

nonn

Author

R. H. Hardin Mar 22 2013

Status

approved