Using an infinite supply of integers of a set S, how many ways are there to reach a sum of n?Clarification: The Integers are arbitrary, positive, and may not include 1.At first I thought it was the coin changing problem without pennies, but it's not because the order is important so coin changing will always be less.It's also like Leonardo's Leaps but with arbitrary leap sizes, and again possibly without a leap of 1.
How many ways to find a sum totalling n using only certain Integers?
algorithms;combinatorics;recursion;integers