Hello, I was the person who started this thread. About 20 months later I again have to revisit this topic.

However this time the Integer Partition has conditions.

For example we are to find integer partition of 50 of size 9, i.e. a + b + c + d + e + f + g + h + i = 50

but the numbers 1, 2 and 3 must be excluded from the partition. i.e. minimum integer should be 4 from a to i.

Please advice how that is to be accomplished? There are 15224 partitions of 50, with size 9. But they include 1, 2, and 3 too. 

In discrete math there is a formula related to generating functions, that can solve it. But I am trying to write a program to accomplish this task.

Thanks a lot