login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A223436
Generalized Petersen graph (8,2) coloring a rectangular array: number of n X 4 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.
1
432, 7424, 147520, 3099264, 67182208, 1485628224, 33277934848, 751557814208, 17060996532992, 388541047749184, 8866017102928512, 202557753134780608, 4631201059795429632, 105934451744168513600, 2423832070620348866432
OFFSET
1,1
COMMENTS
Column 4 of A223440.
LINKS
FORMULA
Empirical: a(n) = 37*a(n-1) -272*a(n-2) -2014*a(n-3) +20537*a(n-4) -19463*a(n-5) -166878*a(n-6) +279708*a(n-7) +430814*a(n-8) -869500*a(n-9) -281352*a(n-10) +853376*a(n-11) -53696*a(n-12) -245568*a(n-13) +62720*a(n-14).
EXAMPLE
Some solutions for n=3
..8..0..8.14....7..6..7..0....4.12..4..3....6..7..6..5...14..8.10.12
.14..8..0..8....6..7.15..7....5..4..5..4....5..6..7..6....8.14..8.10
.12.14..8..0....7.15..9.15....4.12..4..5....6.14..6..5...10.12.10..2
CROSSREFS
Cf. A223440.
Sequence in context: A234400 A236279 A223595 * A230922 A109123 A223688
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 20 2013
STATUS
approved