

A208217


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


2



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, 40, 38, 37, 40, 38, 48, 44, 48, 46, 49, 57, 54, 54, 58, 59, 72, 63, 68, 67, 70, 83, 80
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,6


LINKS



EXAMPLE

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


MAPLE

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


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



