|
Search: id:A078408
|
|
|
| A078408 |
|
Number of ways to partition 2n+1 into distinct positive integers. |
|
+0
8
|
|
| 1, 2, 3, 5, 8, 12, 18, 27, 38, 54, 76, 104, 142, 192, 256, 340, 448, 585, 760, 982, 1260, 1610, 2048, 2590, 3264, 4097, 5120, 6378, 7917, 9792, 12076, 14848, 18200, 22250, 27130, 32992, 40026, 48446, 58499, 70488, 84756, 101698, 121792, 145578, 173682
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Euler transform of period 16 sequence [2,0,1,1,1,1,2,0,2,1,1,1,1,0,2,0,...]. - Michael Somos, Mar 04 2003
|
|
FORMULA
|
a(n) = t(2*n+1, 0), t as defined in A079211.
Odd entries of A000009. G.f.: 1/[(1-x)(1-x^3)(1-x^5)...] - Jon Perry (perry(AT)globalnet.co.uk), May 27 2004
|
|
PROGRAM
|
(PARI) a(n)=local(X); if(n<0, 0, X=x+O(x^(2*n+2)); polcoeff(eta(X^2)/eta(X), 2*n+1))
|
|
CROSSREFS
|
Cf. A035294, A078409, A078410. a(n)=A000009(2n+1).
Sequence in context: A122928 A001524 A136275 this_sequence A007478 A014605 A132842
Adjacent sequences: A078405 A078406 A078407 this_sequence A078409 A078410 A078411
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Dec 27 2002
|
|
EXTENSIONS
|
More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 28 2002
|
|
|
Search completed in 0.002 seconds
|
