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.

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

Original entry on oeis.org

1, 4, 7, 35, 145, 770, 4029, 22739, 130282, 766177, 4566523, 27587850, 168340643, 1036444786, 6429150260, 40144480583
Offset: 1

Views

Author

R. H. Hardin, Mar 06 2012

Keywords

Comments

Column 3 of A209344.

Examples

			Some solutions for n=8:
.-3...-3...-3...-3...-3...-3...-2...-3...-3...-3...-3...-3...-3...-3...-3...-3
..1....0...-2...-2....0....1....0....0...-1...-2...-1...-2....0....0...-2...-2
.-2...-1....1....1....0....1....2...-1...-2....2....0....2...-1....0...-2....0
..1....3....2....1...-3...-2...-1...-1....2....1....3....3...-2...-1....3....0
..0....0....2....0....1...-2....0....1....2....3....1....2....1....2....2....2
.-2....3...-2...-3....0....2....1...-2....0...-3...-2...-3....2....0....1...-1
..3...-3...-1....3....2....1...-2....3....0...-1....3....2....0....1....0....2
..2....1....3....3....3....2....2....3....2....3...-1...-1....3....1....1....2
		

Crossrefs

Cf. A209344.