How many partitions of 100 into 10 parts are there with all parts having DIFFERENT sizes?
I tried brute force, but ill take to long, and i can't find a Simple way to get it.
I was thinking in summation with (i) ... But i can't reach the answer.
How many partitions of 100 into 10 parts are there with all parts having DIFFERENT sizes?
I tried brute force, but ill take to long, and i can't find a Simple way to get it.
I was thinking in summation with (i) ... But i can't reach the answer.
Sequence https://oeis.org/A008289 contains a table of the number of ways to split an integer n into k parts of different size. It gives a recursive formula which produces 33401 in row 100 and column 10 of the table:
1
1 1
1 1 0
1 2 0 0
1 2 1 0 0
1 3 1 0 0 0
1 3 2 0 0 0 0
1 4 3 0 0 0 0 0
1 4 4 1 0 0 0 0 0
1 5 5 1 0 0 0 0 0 0
1 5 7 2 0 0 0 0 0 0 0
1 6 8 3 0 0 0 0 0 0 0 0
1 6 10 5 0 0 0 0 0 0 0 0 0
1 7 12 6 1 0 0 0 0 0 0 0 0 0
1 7 14 9 1 0 0 0 0 0 0 0 0 0 0
1 8 16 11 2 0 0 0 0 0 0 0 0 0 0 0
1 8 19 15 3 0 0 0 0 0 0 0 0 0 0 0 0
1 9 21 18 5 0 0 0 0 0 0 0 0 0 0 0 0 0
1 9 24 23 7 0 0 0 0 0 0 0 0 0 0 0 0 0 0