How many ways can I write a positive integer n as a sum of k nonnegative integers up to commutativity with condition the large number of k is d ?
For example, I can write 8 as 4+3+1, 4+1+3, 3+4+1, 3+1+4, 1+4+3, 1+3+4, 4+2+2, 2+4+2 and 2+4+4 where k=3 and d=4.