|
Search: id:A058695
|
|
|
| A058695 |
|
Number of ways to partition 2n+1 into positive integers. |
|
+0
2
|
|
| 1, 3, 7, 15, 30, 56, 101, 176, 297, 490, 792, 1255, 1958, 3010, 4565, 6842, 10143, 14883, 21637, 31185, 44583, 63261, 89134, 124754, 173525, 239943, 329931, 451276, 614154, 831820, 1121505, 1505499, 2012558, 2679689, 3554345
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Euler transform of period 16 sequence [3,1,2,2,2,2,3,1,3,2,2,2,2,1,3,1,...]. - Michael Somos, Apr 25 2003
|
|
FORMULA
|
G.f.: (Sum_{n>=0} x^A074377(n))/(Product_{n>0}(1-x^n))^2. - Michael Somos, Apr 25 2003
|
|
MAPLE
|
with(combinat): with(numtheory): a := proc(n) c := 1: l := sort(convert(divisors(n), list)): for i from 1 to nops(l) do c := numbpart(l[i]*2-1) od: RETURN(c): end: for j from 1 to 61 do printf(`%d, `, a(j)) od: - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 14 2007
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, polcoeff(1/eta(x+O(x^(2*n+2))), 2*n+1))
|
|
CROSSREFS
|
a(n)=A000041(2n+1). Cf. A058696.
Adjacent sequences: A058692 A058693 A058694 this_sequence A058696 A058697 A058698
Sequence in context: A120538 A002545 A055795 this_sequence A023610 A062544 A120411
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Dec 31 2000
|
|
|
Search completed in 0.002 seconds
|
