This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160551 Number of (unordered) ways of making change for n dollars using coins of denominations 1, 5, 10, and 25. 1
 1, 242, 1463, 4464, 10045, 19006, 32147, 50268, 74169, 104650, 142511, 188552, 243573, 308374, 383755, 470516, 569457, 681378, 807079, 947360, 1103021 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The n-th value is the number of distinct quadruplets (p, n, d, q) of nonnegative integers satisfying p + 5n + 10d + 25q = 100n. LINKS FORMULA a(n) is the coefficient of x^(100n) in f(x)=1/((1-x)(1-x^5)(1-x^10)(1-x^25)) a(n) = (3 + 53*n + 270*n^2 + 400*n^3) / 3 EXAMPLE There are four ways to make \$0.10: (1) 10 pennies, (2) 5 pennies and 1 nickel, (3) 2 nickels, and (4) 1 dime. MAPLE f := 1/(1-x)/(1-x^5)/(1-x^10)/(1-x^25); a := n -> (convert(series(f, x, 100*n+1), polynom)-convert(series(f, x, 100*n), polynom)) /x^(100*n); a := n -> (3 + 53*n + 270*n^2 + 400*n^3) / 3; CROSSREFS Sequence in context: A258894 A258887 A234484 * A258886 A165935 A318529 Adjacent sequences:  A160548 A160549 A160550 * A160552 A160553 A160554 KEYWORD easy,nonn AUTHOR Lee A. Newberg, May 18 2009, Jun 15 2009 STATUS approved

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

Last modified November 13 12:45 EST 2019. Contains 329094 sequences. (Running on oeis4.)