Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #12 Apr 25 2012 12:19:03
%S 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,
%T 14,15,14,14,20,16,18,18,20,25,24,23,24,24,32,27,30,31,30,39,38,36,39,
%U 37,47,43,47,45,48,55,53,53,56,57,69,61,65,65,67,78,77
%N 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.
%H Alois P. Heinz, <a href="/A208216/b208216.txt">Table of n, a(n) for n = 0..1000</a>
%H Doron Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/dmp.html">Using Generatingfunctionology to enumerate distinct-multiplicity partitions</a>.
%e 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.)
%p # for a g.f. in Maple format see the Doron Zeilberger link.
%Y Cf. A001299, A208217.
%K nonn
%O 0,6
%A _Matthew C. Russell_, Apr 24 2012