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.

A188115 Number of strictly increasing arrangements of n nonzero numbers in -n..n with sum zero.

Original entry on oeis.org

0, 2, 2, 8, 16, 52, 152, 484, 1536, 5064, 16946, 57528, 197616, 686588, 2407538, 8510428, 30300268, 108575996, 391301260, 1417520988, 5159160792, 18857230104, 69193592020, 254802169904, 941383915572, 3488574124056, 12964318919492
Offset: 1

Views

Author

R. H. Hardin Mar 21 2011

Keywords

Comments

Column 2 of A188122

Examples

			Some solutions for n=6
.-5...-5...-6...-6...-5...-6...-6...-6...-6...-5...-6...-4...-6...-6...-5...-6
.-4...-4...-4...-5...-4...-5...-5...-3...-4...-3...-5...-3...-4...-2...-4...-4
.-1...-1...-2...-1...-2...-4...-3...-2...-1...-1...-1...-1...-2...-1...-2...-1
..1....1....2....3....2....4....3....2....2....2....2....1....3....1....1....2
..4....3....4....4....4....5....5....3....3....3....4....2....4....2....4....4
..5....6....6....5....5....6....6....6....6....4....6....5....5....6....6....5

Links

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.