A223604 - OEIS

A223604

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, diagonal or antidiagonal neighbor moves along an edge of this graph

16777216, 217600, 21308000, 982848688, 77164934624, 5493636282928, 430525083804688, 33412125075233264, 2632417918238601216, 207242362758169075664, 16354092687858619453040, 1290529367734515426273264

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

OFFSET

1,1

COMMENTS

Row 6 of A223599

LINKS

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

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..1..0...10..8.10...10..8.14....0..1..0...10..8.10....0..8.14....0..1..0

..9..1..2...14..8.10...14..8..0....0..7..0...10..8.10...14..8.14....2..1..9