A184240 T(n,k)=Number of strings of numbers x(i=1..n) in 0..k with sum i^2*x(i)^2 equal to n^2*k^2.
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 5, 4, 2, 1, 1, 2, 2, 3, 5, 4, 1, 1, 1, 1, 2, 15, 15, 41, 7, 3, 1, 1, 1, 2, 11, 24, 31, 36, 19, 3, 1, 1, 3, 1, 30, 43, 213, 119, 199, 47, 4, 1, 1, 2, 5, 5, 47, 176, 356, 555, 420, 71, 2, 1, 1, 2, 3, 79, 88, 706, 962, 2531, 2138
Offset: 1
Examples
Some solutions for n=6 k=5 ..4....2....0....0....0....4....0....4....4....0....0....0....0....0....0....0 ..2....4....2....5....4....5....4....0....4....2....5....5....3....4....0....4 ..2....0....4....0....4....4....4....4....4....4....4....0....4....0....0....2 ..4....4....1....4....1....2....4....2....0....2....4....5....3....5....0....5 ..0....0....4....4....2....0....4....2....2....2....4....4....0....4....0....4 ..4....4....3....2....4....4....1....4....4....4....0....0....4....1....5....0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..393
Crossrefs
Column 1 is A030273
Comments