|
Search: id:A001310
|
|
|
| A001310 |
|
Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents. |
|
+0
1
|
|
| 1, 1, 2, 2, 4, 4, 6, 6, 9, 9, 13, 13, 18, 18, 24, 24, 31, 31, 39, 39, 50, 50, 62, 62, 77, 77, 93, 93, 112, 112, 134, 134, 159, 159, 187, 187, 218, 218, 252, 252, 293, 293, 337, 337, 388, 388, 442, 442, 503, 503, 571
(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
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 180
Index entries for sequences related to making change.
|
|
MAPLE
|
1/(1-x)/(1-x^2)/(1-x^4)/(1-x^10)/(1-x^20)/(1-x^40)/(1-x^100)
|
|
MATHEMATICA
|
a[n_] := SeriesTerm[1/((1 - x)(1 - x^2)(1 - x^4)(1 - x^10)(1 - x^40)(1 - x^100)), {x, 0, n}]
|
|
CROSSREFS
|
Sequence in context: A029010 A060027 A001362 this_sequence A029009 A023023 A008643
Adjacent sequences: A001307 A001308 A001309 this_sequence A001311 A001312 A001313
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
