|
Search: id:A035363
|
|
|
| A035363 |
|
Number of partitions of n into even parts. |
|
+0
5
|
|
| 1, 0, 1, 0, 2, 0, 3, 0, 5, 0, 7, 0, 11, 0, 15, 0, 22, 0, 30, 0, 42, 0, 56, 0, 77, 0, 101, 0, 135, 0, 176, 0, 231, 0, 297, 0, 385, 0, 490, 0, 627, 0, 792, 0, 1002, 0, 1255, 0, 1575, 0, 1958, 0, 2436, 0, 3010, 0, 3718, 0, 4565, 0, 5604, 0, 6842, 0, 8349, 0, 10143, 0, 12310, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
FORMULA
|
G.f.: prod(1/(1-x^k), k even)
Convolution with the number of partitions into distinct parts (A000009, which is also number of partitions into odd parts) gives the number of partitions (A000041). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jan 06 2006
|
|
MAPLE
|
ZL:= [S, {C = Cycle(B), S = Set(C), E = Set(B), B = Prod(Z, Z)}, unlabelled]: seq(combstruct[count](ZL, size=n), n=0..69); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 26 2008
|
|
CROSSREFS
|
Subsequence a(2n) is simply the partition numbers A000041.
First column (m=0) of triangle A103919.
Adjacent sequences: A035360 A035361 A035362 this_sequence A035364 A035365 A035366
Sequence in context: A008820 A066682 A049641 this_sequence A079977 A008799 A011013
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Olivier Gerard (ogerard(AT)ext.jussieu.fr)
|
|
|
Search completed in 0.002 seconds
|
