|
%I #55 Jun 21 2022 09:54:53
%S 1,2,2,6,6,10,18,22,30,42,66,78,110,138,186,254,318,402,522,654,822,
%T 1074,1306,1638,2022,2514,3058,3798,4662,5658,6882,8358,10062,12186,
%U 14610,17534,21150,25146,29994,35694,42446,50178,59514,70110,82758,97602,114570,134262
%N G.f.: Product_{k>=1} (1 + 2*x^k).
%C "EFK" (unordered, size, unlabeled) transform of 2,2,2,2,...
%C Number of partitions into distinct parts of 2 sorts, see example. - _Joerg Arndt_, May 22 2013
%C In general, for a fixed integer m > 0, if g.f. = Product_{k>=1} (1 + m*x^k) then a(n) ~ c^(1/4) * exp(2*sqrt(c*n)) / (2*sqrt((m+1)*Pi)*n^(3/4)), where c = Pi^2/6 + log(m)^2/2 + polylog(2, -1/m) = -polylog(2, -m). - _Vaclav Kotesovec_, Jan 04 2016
%C Antidiagonal sums of A284593. - _Peter Bala_, Mar 30 2017
%H Vaclav Kotesovec, <a href="/A032302/b032302.txt">Table of n, a(n) for n = 0..10000</a>
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%H Vaclav Kotesovec, <a href="/A032302/a032302.pdf">Asymptotic formula for A032302</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Dilogarithm.html">Dilogarithm</a>
%H Eric Weisstein's MathWorld, <a href="http://mathworld.wolfram.com/Polylogarithm.html">Polylogarithm</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Polylogarithm">Polylogarithm</a>
%F a(n) = A072706(n)*2 for n>=1.
%F G.f.: Sum_{n>=0} (2^n*q^(n*(n+1)/2) / Product_{k=1..n} (1-q^k ) ). - _Joerg Arndt_, Jan 20 2014
%F a(n) = (1/3) [x^n] QPochhammer(-2,x). - _Vladimir Reshetnikov_, Nov 20 2015
%F a(n) ~ c^(1/4) * exp(2*sqrt(c*n)) / (2*sqrt(3*Pi)*n^(3/4)), where c = Pi^2/6 + log(2)^2/2 + polylog(2, -1/2) = 1.43674636688368094636290202389358335424... . Equivalently, c = A266576 = Pi^2/12 + log(2)^2 + polylog(2, 1/4)/2. - _Vaclav Kotesovec_, Jan 04 2016
%e From _Joerg Arndt_, May 22 2013: (Start)
%e There are a(7) = 22 partitions of 7 into distinct parts of 2 sorts (format P:S for part:sort):
%e 01: [ 1:0 2:0 4:0 ]
%e 02: [ 1:0 2:0 4:1 ]
%e 03: [ 1:0 2:1 4:0 ]
%e 04: [ 1:0 2:1 4:1 ]
%e 05: [ 1:0 6:0 ]
%e 06: [ 1:0 6:1 ]
%e 07: [ 1:1 2:0 4:0 ]
%e 08: [ 1:1 2:0 4:1 ]
%e 09: [ 1:1 2:1 4:0 ]
%e 10: [ 1:1 2:1 4:1 ]
%e 11: [ 1:1 6:0 ]
%e 12: [ 1:1 6:1 ]
%e 13: [ 2:0 5:0 ]
%e 14: [ 2:0 5:1 ]
%e 15: [ 2:1 5:0 ]
%e 16: [ 2:1 5:1 ]
%e 17: [ 3:0 4:0 ]
%e 18: [ 3:0 4:1 ]
%e 19: [ 3:1 4:0 ]
%e 20: [ 3:1 4:1 ]
%e 21: [ 7:0 ]
%e 22: [ 7:1 ]
%e (End)
%p b:= proc(n, i) option remember; `if`(i*(i+1)/2<n, 0,
%p `if`(n=0, 1, b(n, i-1)+`if`(i>n, 0, 2*b(n-i, i-1))))
%p end:
%p a:= n-> b(n$2):
%p seq(a(n), n=0..60); # _Alois P. Heinz_, Aug 24 2015
%p # Alternatively:
%p simplify(expand(QDifferenceEquations:-QPochhammer(-2,x,99)/3,x)):
%p seq(coeff(%,x,n), n=0..47); # _Peter Luschny_, Nov 17 2016
%t nn=47; CoefficientList[Series[Product[1+2x^i,{i,1,nn}],{x,0,nn}],x] (* _Geoffrey Critzer_, Sep 07 2013 *)
%t nmax = 40; CoefficientList[Series[Exp[Sum[(-1)^(k+1)*2^k/k*x^k/(1-x^k), {k, 1, nmax}]], {x, 0, nmax}], x] (* _Vaclav Kotesovec_, Aug 25 2015 *)
%t (QPochhammer[-2, x]/3 + O[x]^58)[[3]] (* _Vladimir Reshetnikov_, Nov 20 2015 *)
%o (PARI) N=66; x='x+O('x^N); Vec(prod(n=1,N, 1+2*x^n)) \\ _Joerg Arndt_, May 22 2013
%Y Cf. A000009, A032308, A261562, A261568, A261569, A266576, A284593.
%K nonn
%O 0,2
%A _Christian G. Bower_, Apr 01 1998
|
