|
| |
|
|
A001343
|
|
Number of (unordered) ways of making change for n cents using coins of 5, 10, 20, 50, 100 cents.
|
|
0
| |
|
|
1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4, 0, 0, 0, 0, 6, 0, 0, 0, 0, 6, 0, 0, 0, 0, 9, 0, 0, 0, 0, 9, 0, 0, 0, 0, 13, 0, 0, 0, 0, 13, 0, 0, 0, 0, 18, 0, 0, 0, 0, 18, 0, 0, 0, 0, 24, 0, 0, 0, 0, 24, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,11
|
|
|
REFERENCES
| R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 316.
G. P\'{o}lya and G. Szeg\"{o}, Problems and Theorems in Analysis, Springer-Verlag, NY, 2 vols., 1972, Vol. 1, p. 1.
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 185
Index entries for sequences related to making change.
|
|
|
MAPLE
| 1/(1-x^5)/(1-x^10)/(1-x^20)/(1-x^50)/(1-x^100)
|
|
|
MATHEMATICA
| a[n_] := SeriesTerm[1/((1 - x^5)(1 - x^10)(1 - x^20)(1 - x^50)(1 - x^100)), {x, 0, n}]
|
|
|
CROSSREFS
| Sequence in context: A166301 A187081 A037134 * A022882 A171919 A000089
Adjacent sequences: A001340 A001341 A001342 * A001344 A001345 A001346
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
| |
|
|
