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.

A188364 Number of arrangements of 9 numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.

Original entry on oeis.org

4671, 173409, 1763151, 10396729, 40629247, 136061137, 355442823, 870473329, 1876439327, 3821007601, 7047842559
Offset: 1

Views

Author

R. H. Hardin Mar 28 2011

Keywords

Comments

Row 8 of A188358

Examples

			Some solutions for n=4
.-4...-3...-3...-3...-4...-3...-4...-4...-3...-3...-4...-4...-3...-4...-3...-3
.-4...-4...-4...-4...-4...-4...-4...-4...-4...-4...-4...-4...-4...-4...-4...-4
..0....0....1....1...-4....0....2...-1....0...-4...-1....2....1....1....1....1
.-1...-4...-1...-4...-3...-1...-2....3....3....4....4...-2....1....1...-1....1
..3...-3...-1....2....4....4...-1...-4...-4...-2...-3....2...-3...-3...-2...-3
.-2....2....2....4...-4...-4...-2....1...-1....2....0...-2....4...-2....1....4
..2...-3...-4....0....4...-3....2....3....1...-1...-1....0....0...-4....2....0
.-3....4...-1....2....2....4...-4....4...-3....2....2....1....2....3...-3....3
.-1....0....2...-2...-4....2...-1...-4....0....2...-1....4....3...-4....1....2