A184318 T(n,k) = number of strings of numbers x(i=1..n) in 0..k with sum i^2*x(i)^3 equal to n^2*k^3.
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 3, 1, 1, 1, 1, 2, 3, 5, 6, 8, 3, 1, 1, 1, 1, 3, 5, 16, 30, 12, 3, 1, 1, 1, 2, 3, 11, 38, 68, 69, 21, 4, 1, 1, 1, 1, 2, 7, 50, 126, 244, 230, 47, 2, 1, 1, 1, 2, 3, 18, 69, 319, 763, 1106, 662, 117, 7, 1, 1
Offset: 1
Examples
All solutions for n=6 k=5 ..2....0....0....0....0 ..5....1....0....3....2 ..2....4....0....3....3 ..1....1....0....4....2 ..4....4....0....5....5 ..4....4....5....0....3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..264
Crossrefs
Column 1 is A030273.
Comments