A223439 Generalized 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 or vertical neighbor moves along an edge of this graph.

11664, 1180256, 179532768, 33277934848, 6790055219264, 1445484467129440, 313233804577725904, 68373044838570536416, 14968850924351337707600, 3281073242585313313486816, 719543293998612435740651440

Offset: 1

Author

R. H. Hardin Mar 20 2013

Keywords

• nonn

Comments

Column 7 of A223440

Examples

			Some solutions for n=3
..8..0..8.14..8.14..8....8..0..8.14.12.10.12....8..0..8.10.12.14..8
..0..8.14..8.10..8.10....0..8.14..8.10.12.14....0..8.10..8.14.12.10
..8..0..8..0..8.10..2....8..0..8.10..8.10..8....8..0..8.14.12.10..8
		

Links

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