login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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)
7
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,6
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
LINKS
EXAMPLE
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
Sequence in context: A141471 A331572 A127080 * A216635 A213945 A290771
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Sep 11 2012
STATUS
approved