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.

A216633 Number of nondecreasing arrays of n 0..n-1 integers with the sum of their 5th powers equal to sum(i^5,i=0..n-1).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 7, 15, 33, 100, 265, 744, 2174, 6293, 18854
Offset: 1

Views

Author

R. H. Hardin Sep 11 2012

Keywords

Comments

Column 5 of A216635

Examples

			All solutions for n=12
..0....0
..0....1
..1....2
..4....3
..5....4
..5....5
..6....6
..6....7
..9....8
.10....9
.10...10
.10...11