login
A223593
Petersen graph (8,2) coloring a rectangular array: number of n X n 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
0
16, 256, 16192, 2372080, 1807461152, 5493636282928, 78546923445668960, 4667940282157447796816, 1171803483788611809638580832, 1217728112721063886738763846458896
OFFSET
1,1
COMMENTS
Diagonal of A223599
EXAMPLE
Some solutions for n=3
..4..3.11....8.10..8....1..9.11....4.12.10....4..5..6...13.15..9....2.10.12
..2..3..2...12.10.12...15..9.15....4.12.14...13..5..6...13.15.13...12.10..8
.11..3..4...12.14.12...11.13.15...10.12..4....4..5..6....9.11..9...12.10..2
CROSSREFS
Sequence in context: A247165 A204080 A223433 * A067223 A041113 A363689
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 23 2013
STATUS
approved