|
Search: id:A001362
|
|
|
| A001362 |
|
Number of ways of making change for n cents using coins of 1, 2, 4, 10 cents. |
|
+0
1
|
|
| 1, 1, 2, 2, 4, 4, 6, 6, 9, 9, 13, 13, 18, 18, 24, 24, 31, 31, 39, 39, 49, 49, 60, 60, 73, 73, 87, 87, 103, 103, 121, 121, 141, 141, 163, 163, 187, 187, 213, 213, 242, 242, 273, 273, 307, 307, 343, 343, 382, 382, 424
(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 186
Index entries for sequences related to making change.
|
|
MAPLE
|
1/(1-x)/(1-x^2)/(1-x^4)/(1-x^10)
|
|
CROSSREFS
|
Twice A001304.
Sequence in context: A001364 A029010 A060027 this_sequence A001310 A029009 A023023
Adjacent sequences: A001359 A001360 A001361 this_sequence A001363 A001364 A001365
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
