|
Search: id:A001312
|
|
|
| A001312 |
|
Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents. |
|
+0
5
|
|
| 1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 11, 12, 15, 16, 19, 22, 25, 28, 31, 34, 40, 43, 49, 52, 58, 64, 70, 76, 82, 88, 98, 104, 114, 120, 130, 140, 150, 160, 170, 180, 195, 205, 220, 230, 245, 260, 275, 290, 305, 320, 342, 357
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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
|
H. Bottomley, Initial terms of A000008, A001301, A001302, A001312, A001313
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 181
Index entries for sequences related to making change.
|
|
MAPLE
|
1/(1-x)/(1-x^2)/(1-x^5)/(1-x^10)/(1-x^50)/(1-x^100)
|
|
MATHEMATICA
|
a[n_] := SeriesTerm[1/((1 - x)(1 - x^2)(1 - x^5)(1 - x^10)(1 - x^50)(1 - x^100)), {x, 0, n}]
|
|
CROSSREFS
|
Sequence in context: A121385 A029015 A000008 this_sequence A001301 A001302 A001313
Adjacent sequences: A001309 A001310 A001311 this_sequence A001313 A001314 A001315
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
