|
Search: id:A109697
|
|
|
| A109697 |
|
Number of partitions of n into parts each equal to 1 mod 5. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 7, 7, 7, 8, 10, 11, 12, 12, 13, 15, 17, 18, 19, 20, 23, 26, 28, 29, 31, 34, 38, 41, 43, 45, 50, 55, 60, 63, 66, 71, 79, 85, 90, 94, 101, 110, 120, 127, 133, 141, 153, 165, 176, 184, 195, 210, 227, 241, 254, 267, 286, 307, 327
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
FORMULA
|
G.f.=1/product(1-x^(1+5j), j=0..infinity). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006
|
|
EXAMPLE
|
a(11)=3 since 11 = 11 = 6+1+1+1+1+1 = 1+1+1+1+1+1+1+1+1+1+1
|
|
MAPLE
|
g:=1/product(1-x^(1+5*j), j=0..25): gser:=series(g, x=0, 85): seq(coeff(gser, x, n), n=0..80); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006
|
|
CROSSREFS
|
Sequence in context: A099480 A025783 A025780 this_sequence A103373 A038539 A109368
Adjacent sequences: A109694 A109695 A109696 this_sequence A109698 A109699 A109700
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Erich Friedman (efriedma(AT)stetson.edu), Aug 07 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006
|
|
|
Search completed in 0.002 seconds
|
