|
Search: id:A109698
|
|
|
| A109698 |
|
Number of partitions of n into parts each equal to 2 mod 5. |
|
+0
1
|
|
| 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 3, 2, 3, 3, 3, 4, 4, 4, 6, 4, 7, 5, 8, 7, 8, 9, 9, 10, 12, 11, 15, 12, 17, 15, 18, 19, 20, 22, 24, 24, 29, 26, 34, 31, 37, 38, 40, 44, 46, 49, 55, 53, 64, 60, 71, 71, 77, 83, 86, 93, 100, 101, 116, 112, 130, 129, 142, 149, 156, 168, 177
(list; graph; listen)
|
|
|
OFFSET
|
0,13
|
|
|
FORMULA
|
G.f.= 1/product(1-x^(2+5j), j=0..infinity). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 15 2006
|
|
EXAMPLE
|
a(12)=2 since 12 = 12 = 2+2+2+2+2+2
|
|
MAPLE
|
g:=1/product(1-x^(2+5*i), i=0..20): gser:=series(g, x=0, 86): seq(coeff(gser, x, n), n=0..82); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 15 2006
|
|
CROSSREFS
|
Sequence in context: A032741 A046051 A025812 this_sequence A029231 A025808 A144079
Adjacent sequences: A109695 A109696 A109697 this_sequence A109699 A109700 A109701
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Erich Friedman (efriedma(AT)stetson.edu), Aug 07 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 15 2006
|
|
|
Search completed in 0.002 seconds
|
