login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Expansion of Product_{k>=1} 1/(1 - 2*t^k).
46

%I #108 Oct 30 2023 07:53:14

%S 1,2,6,14,34,74,166,350,746,1546,3206,6550,13386,27114,54894,110630,

%T 222794,447538,898574,1801590,3610930,7231858,14480654,28983246,

%U 58003250,116054034,232186518,464475166,929116402,1858449178,3717247638,7434950062,14870628026,29742206138,59485920374,118973809798,237950730522,475905520474

%N Expansion of Product_{k>=1} 1/(1 - 2*t^k).

%C See A083355 for a similar formula. - _Thomas Wieder_, May 07 2008

%C Partitions of n into 2 sorts of parts: the parts are unordered, but not the sorts; see example and formula by Wieder. - _Joerg Arndt_, Apr 28 2013

%C Convolution inverse of A070877. - _George Beck_, Dec 02 2018

%C Number of conjugacy classes of n X n matrices over GF(2). Cf. Morrison link, section 2.9. - _Geoffrey Critzer_, May 26 2021

%H Alois P. Heinz, <a href="/A070933/b070933.txt">Table of n, a(n) for n = 0..1000</a> (first 501 terms from T. D. Noe)

%H Dragomir Z. Djokovic, <a href="https://doi.org/10.1016/j.jalgebra.2006.09.018">Poincaré series of some pure and mixed trace algebras of two generic matrices</a>, Journal of Algebra, Vol. 309, No. 2 (2007), 654-671, arXiv:<a href="https://arxiv.org/abs/math/0609262">math/0609262</a>.

%H Kent E. Morrison, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL9/Morrison/morrison37.html">Integer Sequences and Matrices Over Finite Fields</a>, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.

%H Igor Pak, Greta Panova, and Damir Yeliussizov, <a href="https://arxiv.org/abs/1804.04693">On the largest Kronecker and Littlewood-Richardson coefficients</a>, arXiv:1804.04693 [math.CO], 2018.

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>.

%F a(n) = (1/n)*Sum_{k=1..n} A054598(k)*a(n-k). - _Vladeta Jovovic_, Nov 23 2002

%F a(n) is asymptotic to c*2^n where c=3.46253527447396564949732... - _Benoit Cloitre_, Oct 26 2003. Right value of this constant is c = 1/A048651 = 3.46274661945506361153795734292443116454075790290443839132935303175891543974042... . - _Vaclav Kotesovec_, Sep 09 2014

%F Euler transform of A000031(n). - _Vladeta Jovovic_, Jun 23 2004

%F a(n) = Sum_{k=1..n} p(n,k)*A000079(k) where p(n,k) = number of integer partitions of n into k parts. - _Thomas Wieder_, May 07 2008

%F a(n) = S(n,1), where S(n,m) = 2 + Sum_{k=m..floor(n/2)} 2*S(n-k,k)), S(n,n)=2, S(0,m)=1, S(n,m)=0 for n < m. - _Vladimir Kruchinin_, Sep 07 2014

%F a(n) = Sum_{lambda,mu,nu} (c^{lambda}_{mu,nu})^2, where lambda ranges over all partitions of n, mu and nu range over all partitions satisfying |mu| + |nu| = n, and c^{lambda}_{mu,nu} denotes a Littlewood-Richardson coefficient. - _Richard Stanley_, Nov 16 2014

%F G.f.: Sum_{i>=0} 2^i*x^i/Product_{j=1..i} (1 - x^j). - _Ilya Gutkovskiy_, Apr 12 2018

%F G.f.: Product_{j>=1} Product_{i>=1} 1/(1-x^(i*j))^A001037(j) given in Morrison link section 2.9. - _Geoffrey Critzer_, May 26 2021

%e From _Joerg Arndt_, Apr 28 2013: (Start)

%e There are a(3)=14 partitions of 3 with 2 ordered sorts. Here p:s stands for "part p of sort s":

%e 01: [ 1:0 1:0 1:0 ]

%e 02: [ 1:0 1:0 1:1 ]

%e 03: [ 1:0 1:1 1:0 ]

%e 04: [ 1:0 1:1 1:1 ]

%e 05: [ 1:1 1:0 1:0 ]

%e 06: [ 1:1 1:0 1:1 ]

%e 07: [ 1:1 1:1 1:0 ]

%e 08: [ 1:1 1:1 1:1 ]

%e 09: [ 2:0 1:0 ]

%e 10: [ 2:0 1:1 ]

%e 11: [ 2:1 1:0 ]

%e 12: [ 2:1 1:1 ]

%e 13: [ 3:0 ]

%e 14: [ 3:1 ]

%e (End)

%p b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,

%p b(n, i-1) +`if`(i>n, 0, 2*b(n-i, i))))

%p end:

%p a:= n-> b(n$2):

%p seq(a(n), n=0..50); # _Alois P. Heinz_, Sep 07 2014

%t CoefficientList[ Series[ Product[1 / (1 - 2t^k), {k, 1, 35}], {t, 0, 35}], t]

%t CoefficientList[Series[E^Sum[2^k*x^k / (k*(1-x^k)),{k,1,30}],{x,0,30}],x] (* _Vaclav Kotesovec_, Sep 09 2014 *)

%t (O[x]^20 - 1/QPochhammer[2,x])[[3]] (* _Vladimir Reshetnikov_, Nov 20 2015 *)

%o (PARI) N=66; q='q+O('q^N); Vec(1/sum(n=0, N, (-2)^n*q^(n*(n+1)/2) / prod(k=1, n, 1-q^k ) )) \\ _Joerg Arndt_, Mar 09 2014

%o (Maxima)

%o S(n,m):=if n=0 then 1 else if n<m then 0 else if n=m then 2 else sum(2*S(n-k,k),k,m,n/2)+2;

%o makelist(S(n,1),n,0,17); /* _Vladimir Kruchinin_, Sep 07 2014 */

%o (Magma) m:=50; R<x>:=PowerSeriesRing(Rationals(), m); Coefficients(R! ( (&*[1/(1-2*x^k): k in [1..m]]) )); // _G. C. Greubel_, Oct 31 2018

%Y Cf. A006951, A000041, A070877.

%Y Cf. A083355.

%Y Column k=2 of A246935.

%Y Cf. A048651.

%Y Row sums of A256193.

%Y Antidiagonal sums of A322210.

%K nonn

%O 0,2

%A Sharon Sela (sharonsela(AT)hotmail.com), May 21 2002

%E Edited and extended by _Robert G. Wilson v_, May 25 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 09:18 EDT 2024. Contains 376189 sequences. (Running on oeis4.)