|
Search: id:A000064
|
|
|
| A000064 |
|
Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.
(Formerly M1002 N0375)
|
|
+0
1
|
|
| 1, 2, 4, 6, 9, 13, 18, 24, 31, 39, 50, 62, 77, 93, 112, 134, 159, 187, 218, 252, 292, 335, 384, 436, 494, 558, 628, 704, 786, 874, 972, 1076, 1190, 1310, 1440, 1580, 1730, 1890, 2060, 2240, 2435, 2640, 2860, 3090, 3335, 3595, 3870, 4160, 4465, 4785, 5126
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 152.
|
|
LINKS
|
Christian G. Bower, Table of n, a(n) for n=0..1000
|
|
FORMULA
|
G.f.: 1 / ( 1 - x )^2 ( 1 - x^2 ) ( 1 - x^5 ) ( 1 - x^10 ).
|
|
MAPLE
|
1/(1-x)^2/(1-x^2)/(1-x^5)/(1-x^10)
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, polcoeff(1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10))+x*O(x^n), n))
|
|
CROSSREFS
|
Cf. A000008.
Sequence in context: A079717 A114830 A001304 this_sequence A001305 A088575 A026906
Adjacent sequences: A000061 A000062 A000063 this_sequence A000065 A000066 A000067
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Corrected and extended by Simon Plouffe (plouffe(AT)math.uqam.ca)
|
|
|
Search completed in 0.002 seconds
|
