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).
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
Examples
All solutions for n=8 k=4 ..1....1 ..3....2 ..3....3 ..5....4 ..6....5 ..6....6 ..6....7 ..8....8
Links
- R. H. Hardin, Table of n, a(n) for n = 1..291
Comments