A208216 Number of ways of making change for n cents using coins of 1, 5, 10, and 25 cents, where each coin that appears is used a different number of times.

1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 4, 3, 3, 4, 4, 5, 5, 5, 4, 5, 8, 7, 6, 8, 7, 12, 9, 11, 11, 12, 14, 14, 15, 14, 14, 20, 16, 18, 18, 20, 25, 24, 23, 24, 24, 32, 27, 30, 31, 30, 39, 38, 36, 39, 37, 47, 43, 47, 45, 48, 55, 53, 53, 56, 57, 69, 61, 65, 65, 67, 78, 77

Offset: 0

Author

Matthew C. Russell, Apr 24 2012

Keywords

• nonn

Examples

			For n=6 the a(6)=1 solution is six copies of the 1-cent coin. (Taking one 1-cent coin and one 5-cent coin is not allowed, as those two coins have the same nonzero multiplicity.)
		

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..1000
• Doron Zeilberger, Using Generatingfunctionology to enumerate distinct-multiplicity partitions.

Crossrefs

Cf. A001299, A208217.

Programs

Maple

# for a g.f. in Maple format see the Doron Zeilberger link.