|
Search: id:A109700
|
|
|
| A109700 |
|
Number of partitions of n into parts each equal to 4 mod 5. |
|
+0
1
|
|
| 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 2, 3, 4, 2, 2, 3, 5, 4, 3, 3, 6, 6, 6, 4, 6, 7, 9, 7, 7, 8, 11, 11, 11, 9, 12, 14, 16, 13, 14, 16, 21, 20, 19, 18, 24, 26, 27, 24, 27, 31, 36, 34, 34, 35, 43, 45, 47, 43, 49, 55, 62, 58, 59, 63, 75, 77, 77, 75, 87
(list; graph; listen)
|
|
|
OFFSET
|
0,19
|
|
|
FORMULA
|
G.f.=1/product(1-x^(4+5j), j=0..infinity). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006
|
|
EXAMPLE
|
a(30)=2 since 30 = 14+4+4+4+4 = 9+9+4+4+4
|
|
MAPLE
|
g:=1/product(1-x^(4+5*j), j=0..25): gser:=series(g, x=0, 95): seq(coeff(gser, x, n), n=0..90); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006
|
|
CROSSREFS
|
Sequence in context: A079487 A069010 A087048 this_sequence A087742 A072530 A090455
Adjacent sequences: A109697 A109698 A109699 this_sequence A109701 A109702 A109703
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Erich Friedman (efriedma(AT)stetson.edu), Aug 07 2005
|
|
EXTENSIONS
|
More terms from Michael Somos, Aug 10 2005
|
|
|
Search completed in 0.002 seconds
|
