close
login
A223697
Petersen graph (8,2) coloring a rectangular array: number of 6Xn 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 or antidiagonal neighbor moves along an edge of this graph.
1
16777216, 2834352, 154616832, 9762152544, 814399853760, 74643295612752, 7306668414672912, 734664480565454496, 74933418159318970224, 7689928159453619621520, 791546397676585132552128
OFFSET
1,1
COMMENTS
Row 6 of A223692
LINKS
EXAMPLE
Some solutions for n=3
..0..8..0....0..8..0....0..8..0....0..8..0....0..8..0....0..8..0....0..8..0
..0..8..0....0..8..0....0..8.10....0..8..0....0..8..0....0..8..0....0..8.10
.14..8.14...14..8.10...10.12..4...10..8.14...10..8.14....0..1..9...10..8.10
.10.12.10....0..8.10...14.12.14...10..8.10...14.12..4....0..1..0...14..8.14
.14.12.14...14..8.10...10.12..4...14.12.10....4.12.10....9..1..9....0..8.14
.14..6..7...10..8..0....4.12.14...10..8.14...10..2.10....9.15.13...14.12..4
CROSSREFS
Sequence in context: A011574 A022540 A223604 * A057070 A067494 A177081
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 25 2013
STATUS
approved