Suspicion: this is because a positive integer is a linked list. Every integer is defined by a unary root element and then a series of successors until its cardi

Suspicion: this is because a positive integer is a linked list. Every integer is defined by a unary root element and then a series of successors until its cardinality matches the corresponding symbol (counting is correspondence). > find the count of subsets that sum to a particular number without actually enumerating them all. Would the generating formula for partition numbers[0] work, or am I misunderstanding this problem? (I think actually generating the subsets is necessarily a dynamic programming problem...) [0] https://en.wikipedia.org/wiki/Partition_(number_theory)#:~:text=the%20generating%20function%20formula%20described%20below%3A https://en.wikipedia.org/wiki/Partition_(number_theory)#:~:t...