To find the number of ways an integer n can be partitioned into k positive

k
X
integers we have first xi = n with x1 ≤ x2 . . . ≤ xk where x1 ≥ 1
i=1
Let x2 = x1 + h1 , x3 = x2 + h2 . . . xk = xk−1 + hk−1 where all h ≥ 0.

Then n = k(x1 ) + (k − 1)(h1 ) . . . + hk−1

The generating function is then

(xk + x2k + x3k . . .)(1 + xk−1 + x2(k−1) . . .)(1 + xk−2 + x2(k−2) . . .) . . .
(1 + x + x2 + x3 . . .)

xk 1
Which simplifies to ·
1 − x (1 − x )(1 − xk−2 ) . . . (1 − x)
k k−1

The coefficient of xn in the expansion is the number of k-partitions of n.

Using this method, we need to take a sum of the coefficients of n from
k = 1 to k = n to find the total number of partitions of n. How much can
the generating function above be simplified?