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.

A216645 T(n,k)=Number of nondecreasing arrays of n 1..n integers with the sum of their k powers equal to sum(i^k,i=1..n).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 5, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 32, 1, 1, 1, 1, 1, 3, 94, 1, 1, 1, 1, 1, 2, 8, 289, 1, 1, 1, 1, 1, 1, 2, 25, 910, 1, 1, 1, 1, 1, 1, 2, 6, 83, 2934, 1, 1, 1, 1, 1, 1, 1, 2, 12, 257, 9686, 1, 1, 1, 1, 1, 1, 1, 1, 5, 30, 788, 32540, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 76, 2491
Offset: 1

Views

Author

R. H. Hardin Sep 11 2012

Keywords

Comments

Table starts
.......1......1.....1....1..1..1.1
.......1......1.....1....1..1..1.1
.......2......1.....1....1..1..1.1
.......5......1.....1....1..1..1.1
......12......1.....1....1..1..1.1
......32......3.....2....1..1..1.1
......94......8.....2....2..1..1.1
.....289.....25.....6....2..1..1.1
.....910.....83....12....5..1..1.1
....2934....257....30...11..1..2.1
....9686....788....76...25..1..2.1
...32540...2491...224...51..2..2.1
..110780...7885...597..136..4..2.1
..381676..25099..1801..367..8..3.1
.1328980..80481..5469..886.21..3.1
.4669367.264505.16958.2507.45.14.1

Examples

			All solutions for n=8 k=4
..1....1
..3....2
..3....3
..5....4
..6....5
..6....6
..6....7
..8....8
		

Crossrefs

Column 1 is A002838(n-1)
sum 0..n-1 instead of 1..n: A216635