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.

A216630 Number of nondecreasing arrays of n 0..n-1 integers with the sum of their 2nd powers equal to sum(i^2,i=0..n-1).

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 14, 37, 105, 309, 939, 2903, 8865, 28163, 90648, 297615, 989077, 3320885, 11280835, 38583017, 133018026, 461630411, 1612842357, 5667628973, 20019876401, 71078302590, 253504107762, 908014000543, 3265037780657
Offset: 1

Views

Author

R. H. Hardin Sep 11 2012

Keywords

Comments

Column 2 of A216635

Examples

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