A223698 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A223698

Petersen graph (8,2) coloring a rectangular array: number of 7Xn 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

268435456, 25509168, 2492365968, 294583794768, 49817845241568, 9525534763343040, 1976213549179804032, 422657522556480917712, 91790405609518662883056, 20048483735293013970568848

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

OFFSET

1,1

COMMENTS

Row 7 of A223692

LINKS

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

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..0

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