|
Search: id:A001319
|
|
|
| A001319 |
|
Number of (unordered) ways of making change for n cents using coins of 2, 5, 10, 20, 50 cents. |
|
+0
2
|
|
| 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 3, 3, 3, 3, 3, 3, 7, 3, 7, 3, 7, 7, 7, 7, 7, 7, 13, 7, 13, 7, 13, 13, 13, 13, 13, 13, 22, 13, 22, 13, 22, 22, 22, 22, 22, 22, 35, 22, 35, 22, 35, 35, 35, 35, 35, 35, 53, 35, 53, 35, 53
(list; graph; listen)
|
|
|
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 184
Index entries for sequences related to making change.
|
|
MAPLE
|
1/(1-x^2)/(1-x^5)/(1-x^10)/(1-x^20)/(1-x^50)
|
|
MATHEMATICA
|
a[n_] := SeriesTerm[1/((1 - x^2)(1 - x^5)(1 - x^10)(1 - x^20)(1 - x^50)), {x, 0, n}]
|
|
CROSSREFS
|
First differences of A001313.
Sequence in context: A135023 A087822 A025810 this_sequence A110919 A109599 A066839
Adjacent sequences: A001316 A001317 A001318 this_sequence A001320 A001321 A001322
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
