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.

A199844 Number of -5..5 arrays x(0..n-1) of n elements with zero sum and no element more than one greater than the previous.

Original entry on oeis.org

1, 6, 25, 103, 399, 1532, 5754, 21383, 78735, 288580, 1053894, 3840866, 13981403, 50874249, 185128907, 673970102, 2455319377, 8952722626, 32676307483, 119391572211, 436711281979, 1599194641093, 5862625449021, 21515851244159
Offset: 1

Views

Author

R. H. Hardin, Nov 11 2011

Keywords

Comments

Column 5 of A199847.

Examples

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

Crossrefs

Cf. A199847.