This is the unbounded knapsack counting problem. The key distinction from Coin Change I is counting combinations (not minimum count) and from permutations (order doesn't matter).
Enable JavaScript for the full StreamPrep guide.