|
Search: id:A001299
|
|
|
| A001299 |
|
Number of ways of making change for n cents using coins of 1, 5, 10, 25 cents. |
|
+0
4
|
|
| 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 9, 9, 9, 9, 9, 13, 13, 13, 13, 13, 18, 18, 18, 18, 18, 24, 24, 24, 24, 24, 31, 31, 31, 31, 31, 39, 39, 39, 39, 39, 49, 49, 49, 49, 49, 60, 60, 60, 60, 60, 73, 73, 73
(list; graph; listen)
|
|
|
OFFSET
|
1,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 175
Index entries for sequences related to making change.
|
|
FORMULA
|
G.f.: 1/((1-x)*(1-x^5)*(1-x^10)*(1-x^25)).
|
|
MAPLE
|
1/((1-x)*(1-x^5)*(1-x^10)*(1-x^25));
|
|
MATHEMATICA
|
CoefficientList[ Series[ 1 / ((1 - x)(1 - x^5)(1 - x^10)(1 - x^25)), {x, 0, 65} ], x ]
|
|
CROSSREFS
|
Sequence in context: A160675 A105674 A130496 this_sequence A001300 A001306 A108105
Adjacent sequences: A001296 A001297 A001298 this_sequence A001300 A001301 A001302
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
