The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Alois P. Heinz, Table of n, a(n) for n = 0..1000 Doron Zeilberger, Using Generatingfunctionology to enumerate distinct-multiplicity partitions. EXAMPLE 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.) MAPLE # for a g.f. in Maple format see the Doron Zeilberger link. CROSSREFS Cf. A169718, A208216. Sequence in context: A363526 A159805 A208216 * A009213 A072209 A226559 Adjacent sequences: A208214 A208215 A208216 * A208218 A208219 A208220 KEYWORD nonn AUTHOR Matthew C. Russell, Apr 24 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 23 14:50 EDT 2024. Contains 372763 sequences. (Running on oeis4.)