|
Search: id:A001314
|
|
|
| A001314 |
|
Number of (unordered) ways of making change for n cents using coins of 2, 5 (two kinds), 10, 20, 50 cents. |
|
+0
2
|
|
| 1, 0, 1, 0, 1, 2, 1, 2, 1, 2, 5, 2, 5, 2, 5, 8, 5, 8, 5, 8, 15, 8, 15, 8, 15, 22, 15, 22, 15, 22, 35, 22, 35, 22, 35, 48, 35, 48, 35, 48, 70, 48, 70, 48, 70, 92, 70, 92, 70, 92, 127, 92, 127, 92, 127, 162, 127, 162, 127, 162
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
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 183
Index entries for sequences related to making change.
|
|
MAPLE
|
1/(1-x^2)/(1-x^5)^2/(1-x^10)/(1-x^20)/(1-x^50)
|
|
MATHEMATICA
|
a[n_] := SeriesTerm[1/((1 - x^2)((1 - x^5)^2)(1 - x^10)(1 - x^20)(1 - x^50)), {x, 0, n}]
|
|
CROSSREFS
|
Sequence in context: A099986 A166478 A050325 this_sequence A020733 A059913 A083273
Adjacent sequences: A001311 A001312 A001313 this_sequence A001315 A001316 A001317
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
