cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A209338 Number of n-bead necklaces labeled with numbers -2..2 allowing reversal, with sum zero with no three beads in a row equal.

Original entry on oeis.org

1, 3, 4, 15, 40, 146, 514, 2032, 8076, 33310, 138966, 589618, 2525494, 10923868, 47599638, 208824200, 921391230, 4086463748, 18206487792
Offset: 1

Views

Author

R. H. Hardin, Mar 06 2012

Keywords

Comments

Column 2 of A209344.

Examples

			Some solutions for n=10:
.-2...-2...-2...-2...-2...-2...-2...-2...-2...-2...-2...-2...-2...-2...-2...-2
.-1...-2...-2...-1...-2...-1...-2...-1....0...-1....0...-1...-2...-1....0...-1
.-2....2....0...-1....1...-1....2....0....1...-1....1....0....1...-2....0...-1
.-1...-2....0....1....0....1...-2...-1....0....1....0....2....2....0...-1....1
..0...-1...-1....2...-1....1....1....0....2....2...-2....0....1....2....2....2
..2....0....1....1....2....0....2....2....0....0....1...-1....2....1...-2....2
..1....2....2....0...-1....0....0...-1...-1....0...-2....0...-2....1....0....0
..1...-1...-1....1....0....2...-2....1....1...-2....1....2...-1...-1....0...-1
..0....2....2....0....1...-2....1....2...-2....1....1...-1...-1....0....1...-2
..2....2....1...-1....2....2....2....0....1....2....2....1....2....2....2....2