Find the generating function for the number of partitions of an integer n, where you can use the integer k at most k times in the partition. As an example, the following at the allowable partitions of 5 that we are looking at here:
5 good
4 + 1 good
3 + 2 good
3 + 1 + 1 not good
2 + 2 + 1 not good
2 + 1 + 1 + 1 not good
1 + 1 + 1 + 1 + 1 not good
Not a lot of calculation or work is needed to answer this question, so we will grade you mostly on your explanation.