(I'm trying to solve a problem for computer programming. Don't have much of a math background, so I hope I am using the right terminology)
Is there a formula for getting the partitions of a number with these three restrictions:
- the partition numbers are from a limited nonconsecutive set.
- Each partition number is distinct and can only be used once in each partition sum.
- The number of partition numbers in each sum is constant.
Any help is appreciated even if it's just pointing me in the right direction to research further.