A223598 Petersen graph (8,2) coloring a rectangular array: number of nX7 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph

11664, 755200, 90390720, 13959069888, 2400064408240, 430525083804688, 78546923445668960, 14429703592790084096, 2658520939017305600464, 490410636478840098415664, 90513619131741471092127136

Offset

1,1

Comments

Column 7 of A223599

Links

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

Example

Some solutions for n=3
..0..8.10..8.10..8.10....0..8..0..8.14.12.10....0..8.10..8.10.12.14
..0..8.10.12.14.12.10....0..8.10..8.14.12.14....0..8.10..8.10.12.10
..0..8.10.12..4.12.10....0..8.10..8.14..6.14....0..8..0..8.14..8.14

Crossrefs

Sequence in context: A214804 A352330 A203821 * A223439 A223691 A254770

Adjacent sequences: A223595 A223596 A223597 * A223599 A223600 A223601

Keyword

nonn

Author

R. H. Hardin Mar 23 2013

Status

approved