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.

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

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 11, 18, 50, 113, 257, 678, 1814
Offset: 1

Views

Author

R. H. Hardin Sep 11 2012

Keywords

Comments

Column 6 of A216635

Examples

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