A014968 -id:A014968 - cp's OEIS frontend

A015128 Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined.

1, 2, 4, 8, 14, 24, 40, 64, 100, 154, 232, 344, 504, 728, 1040, 1472, 2062, 2864, 3948, 5400, 7336, 9904, 13288, 17728, 23528, 31066, 40824, 53408, 69568, 90248, 116624, 150144, 192612, 246256, 313808, 398640, 504886, 637592, 802936, 1008448

Offset: 0

N. J. A. Sloane

The over-partition function.
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Also the number of jagged partitions of n.
According to Ramanujan (1913) a(n) is close to (cosh(x)-sinh(x)/x)/(4*n) where x=Pi*sqrt(n). - Michael Somos, Mar 17 2003
Number of partitions of 2n with all odd parts occurring with even multiplicities. There is no restriction on the even parts. Cf. A006950, A046682. - Mamuka Jibladze, Sep 05 2003
Number of partitions of n where there are two kinds of odd parts. - Joerg Arndt, Jul 30 2011. Or, in Gosper's words, partitions into red integers and blue odd integers. - N. J. A. Sloane, Jul 04 2016.
Coincides with the sequence of numbers of nilpotent conjugacy classes in the Lie algebras sp(n), n=0,1,2,3,... (the case n=0 being degenerate). A006950, this sequence and A000041 together cover the nilpotent conjugacy classes in the classical A,B,C,D series of Lie algebras. - Alexander Elashvili, Sep 08 2003
Also, number of 01-partitions of n. A 01-partition of n is a weakly decreasing sequence of m nonnegative integers n(i) such that sum(n(i))=n, n(m)>0, n(j)>=n(j+1)-1 and n(j)>=n(j+2). They are special cases of jagged partitions.
a(8n+7) is divisible by 64 (from Fortin/Jacob/Mathieu paper).
Smallest sequence of even numbers (except a(0)) which is the Euler transform of a sequence of positive integers. - Franklin T. Adams-Watters, Oct 16 2006
Convolution of A000041 and A000009. - Vladeta Jovovic, Nov 26 2002
Equals A022567 convolved with A035363. - Gary W. Adamson, Jun 09 2009
Equals the infinite product [1,2,2,2,...] * [1,0,2,0,2,0,2,...] * [1,0,0,2,0,0,2,0,0,2,...] * ... . - Gary W. Adamson, Jul 05 2009
Equals A182818 convolved with A010815. - Gary W. Adamson, Jul 20 2012
Partial sums of A211971. - Omar E. Pol, Jan 09 2014
Also 1 together with the row sums of A235790. - Omar E. Pol, Jan 19 2014
Antidiagonal sums of A284592. - Peter Bala, Mar 30 2017
The overlining method is equivalent to enumerating the k-subsets of the distinct parts of the i-th partition. - Richard Joseph Boland, Sep 02 2021

			G.f. = 1 + 2*q + 4*q^2 + 8*q^3 + 14*q^4 + 24*q^5 + 40*q^6 + 64*q^7 + 100*q^8 + ...
For n = 4 the 14 overpartitions of 4 are [4], [4'], [2, 2], [2', 2], [3, 1], [3', 1], [3, 1'], [3', 1'], [2, 1, 1], [2', 1, 1], [2, 1', 1], [2', 1', 1], [1, 1, 1, 1], [1', 1, 1, 1]. - _Omar E. Pol_, Jan 19 2014

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 103.
R. W. Gosper, Experiments and discoveries in q-trigonometry, in Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics. Editors: F. G. Garvan and M. E. H. Ismail. Kluwer, Dordrecht, Netherlands, 2001, pp. 79-105. See the function g(q).
James R. Newman, The World of Mathematics, Simon and Schuster, 1956, Vol. I p. 372.

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (first 1000 terms from T. D. Noe)
Gert Almkvist, Asymptotic formulas and generalized Dedekind sums, Exper. Math., 7 (No. 4, 1998), pp. 343-359.
Brennan Benfield and Arindam Roy, Log-concavity And The Multiplicative Properties of Restricted Partition Functions, arXiv:2404.03153 [math.NT], 2024.
Noureddine Chair, Partition identities from Partial Supersymmetry, arXiv:hep-th/0409011, 2004.
Shi-Chao Chen, On the number of overpartitions into odd parts, Discrete Math. 325 (2014), 32--37. MR3181230.
William Y.C. Chen and Ernest X.W. Xia, Proof of a conjecture of Hirschhorn and Sellers on overpartitions, arXiv:1307.4155 [math.CO], 2013; Acta Arith. 163 (2014), no. 1, 59--69. MR3194057
Sylvie Corteel, Particle seas and basic hypergeometric series, Advances Appl. Math., 31 (2003), 199-214.
Sylvie Corteel and Jeremy Lovejoy, Frobenius partitions and the combinatorics of Ramanujan's 1 psi 1 summation, J. Combin. Theory A 97 (2002), 177-183.
Sylvie Corteel and Jeremy Lovejoy, Overpartitions, Trans. Amer. Math. Soc., 356 (2004), 1623-1635.
Brian Drake, Limits of areas under lattice paths, Discrete Math. 309 (2009), no. 12, 3936-3953.
Benjamin Engel, Log-concavity of the overpartition function, The Ramanujan Journal, Vol. 43, No. 2 (2017), pp. 229-241; arXiv preprint, arXiv:1412.4603 [math.NT], 2014.
Alex Fink, Richard K. Guy and Mark Krusemeyer, Partitions with parts occurring at most thrice, Contributions to Discrete Mathematics, Vol 3, No 2 (2008).
J.-F. Fortin, P. Jacob and P. Mathieu, Jagged partitions, The Ramanujan Journal, Vol. 10, No. 2 (2005), pp. 215-235; arXiv preprint, arXiv:math/0310079 [math.CO], 2003-2005.
Frank Garvan, Table of a(n) for n = 1..10000.
R. W. Gosper, Experiments and discoveries in q-trigonometry, in F. G. Garvan and M. E. H. Ismail (eds.), Symbolic computation, number theory, special functions, physics and combinatorics, Springer, Boston, MA, 2001, pp. 79-105; preprint.
R. W. Gosper, q-Trigonometry: Some Prefatory Afterthoughts
William J. Keith, Restricted k-color partitions, The Ramanujan Journal, Vol. 40, No. 1 (2016), pp. 71-92; arXiv preprint, arXiv:1408.4089 [math.CO], 2014.
Byungchan Kim, A short note on the overpartition function, Discr. Math., 309 (2009), 2528-2532.
Byungchan Kim, Overpartition pairs modulo powers of 2, Discrete Math., 311 (2011), 835-840.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], 2015-2016.
Jeremy Lovejoy, Gordon's theorem for overpartitions, J. Combin. Theory A 103 (2003), 393-401.
Karl Mahlburg, The overpartition function modulo small powers of 2, Discr. Math., 286 (2004), 263-267.
Mircea Merca, Overpartitions in terms of 2-adic valuation, Aequat. Math. (2024). See p. 9.
Igor Pak, Partition bijections, a survey, The Ramanujan Journal, Vol. 12, No. 1 (2006), pp. 5-75; alternative link.
Maxie D. Schmidt, Exact Formulas for the Generalized Sum-of-Divisors Functions, arXiv:1705.03488 [math.NT], 2017-2019. See Example 4.1, p. 13.
Michael Somos, Introduction to Ramanujan theta functions
Liuquan Wang, Another Proof of a Conjecture by Hirschhorn and Sellers on Overpartitions, J. Int. Seq. 17 (2014) # 14.9.8.
Eric Weisstein's World of Mathematics, Modular Equation.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions.
Michael P. Zaletel and Roger S. K. Mong, Exact matrix product states for quantum Hall wave functions, Physical Review B, Vol. 86, No. 24 (2012), 245305; arXiv preprint, arXiv:1208.4862 [cond-mat.str-el], 2012. - From _N. J. A. Sloane_, Dec 25 2012

Cf. A022567, A035363, A002448, A106507, A156616, A261386, A265835, A014968, A284592, A303662.
See A004402 for a version with signs.
Column k=2 of A321884.
Cf. A002513.

# JacobiTheta4 is defined in A002448.
A015128List(len) = JacobiTheta4(len, -1)
A015128List(40) |> println # Peter Luschny, Mar 12 2018

mul((1+x^n)/(1-x^n),n=1..256): seq(coeff(series(%,x,n+1),x,n), n=0..40);
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      b(n, i-1) +2*add(b(n-i*j, i-1), j=1..n/i)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..40);  # Alois P. Heinz, Feb 10 2014
a_list := proc(len) series(1/JacobiTheta4(0,x),x,len+1); seq(coeff(%,x,j),j=0..len) end: a_list(39); # Peter Luschny, Mar 14 2017

max = 39; f[x_] := Exp[Sum[(DivisorSigma[1, 2*n] - DivisorSigma[1, n])*(x^n/n), {n, 1, max}]]; CoefficientList[ Series[f[x], {x, 0, max}], x] (* Jean-François Alcover, Jun 11 2012, after Joerg Arndt *)
a[ n_] := SeriesCoefficient[ QHypergeometricPFQ[ {-1}, {}, x, x], {x, 0, n}]; (* Michael Somos, Mar 11 2014 *)
QP = QPochhammer; s = QP[q^2]/QP[q]^2 + O[q]^40; CoefficientList[s + O[q]^100, q] (* Jean-François Alcover, Nov 25 2015, after Michael Somos *)
Table[Sum[PartitionsP[n-k]*PartitionsQ[k], {k, 0, n}], {n, 0, 50}] (* Vaclav Kotesovec, Nov 28 2015 *)
(QPochhammer[-x, x]/QPochhammer[x, x] + O[x]^50)[[3]] (* Vladimir Reshetnikov, Nov 12 2016 *)
nmax = 100; p = ConstantArray[0, nmax+1]; p[[1]] = 1; Do[p[[n+1]] = 0; k = 1; While[n + 1 - k^2 > 0, p[[n+1]] += (-1)^(k+1)*p[[n + 1 - k^2]]; k++;]; p[[n+1]] = 2*p[[n+1]];, {n, 1, nmax}]; p (* Vaclav Kotesovec, Apr 11 2017 *)
a[ n_] := SeriesCoefficient[ 1 / EllipticTheta[ 4, 0, x], {x, 0, n}]; (* Michael Somos, Nov 15 2018 *)
a[n_] := Sum[2^Length[Union[IntegerPartitions[n][[i]]]], {i, 1, PartitionsP[n]}]; (* Richard Joseph Boland, Sep 02 2021 *)
n = 39; CoefficientList[Product[(1 + x^k)/(1 - x^k), {k, 1, n}] + O[x]^(n + 1), x] (* Oliver Seipel, Sep 19 2021 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^2 + A) / eta(x + A)^2, n))}; /* Michael Somos, Nov 01 2008 */

{a(n)=polcoeff(exp(sum(m=1,n\2+1,2*x^(2*m-1)/(1-x^(2*m-1)+x*O(x^n))/(2*m-1))),n)} /* Paul D. Hanna, Aug 06 2009 */

N=66; x='x+O('x^N); gf=exp(sum(n=1,N,(sigma(2*n)-sigma(n))*x^n/n));Vec(gf) /* Joerg Arndt, Jul 30 2011 */

lista(nn) = {q='q+O('q^nn); Vec(eta(q^2)/eta(q)^2)} \\ Altug Alkan, Mar 20 2018

# uses[EulerTransform from A166861]
a = BinaryRecurrenceSequence(0, 1, 1, 2)
b = EulerTransform(a)
print([b(n) for n in range(40)]) # Peter Luschny, Nov 11 2020

Euler transform of period 2 sequence [2, 1, ...]. - Michael Somos, Mar 17 2003
G.f.: Product_{m>=1} (1 + q^m)/(1 - q^m).
G.f.: 1 / (Sum_{m=-inf..inf} (-q)^(m^2)) = 1/theta_4(q).
G.f.: 1 / Product_{m>=1} (1 - q^(2*m)) * (1 - q^(2*m-1))^2.
G.f.: exp( Sum_{n>=1} 2*x^(2*n-1)/(1 - x^(2*n-1))/(2*n-1) ). - Paul D. Hanna, Aug 06 2009
G.f.: exp( Sum_{n>=1} (sigma(2*n) - sigma(n))*x^n/n ). - Joerg Arndt, Jul 30 2011
G.f.: Product_{n>=0} theta_3(q^(2^n))^(2^n). - Joerg Arndt, Aug 03 2011
A004402(n) = (-1)^n * a(n). - Michael Somos, Mar 17 2003
Expansion of eta(q^2) / eta(q)^2 in powers of q. - Michael Somos, Nov 01 2008
Expansion of 1 / phi(-q) in powers of q where phi() is a Ramanujan theta function. - Michael Somos, Nov 01 2008
Convolution inverse of A002448. - Michael Somos, Nov 01 2008
Recurrence: a(n) = 2*Sum_{m>=1} (-1)^(m+1) * a(n-m^2).
a(n) = (1/n)*Sum_{k=1..n} (sigma(2*k) - sigma(k))*a(n-k). - Vladeta Jovovic, Dec 05 2004
G.f.: Product_{i>=1} (1 + x^i)^A001511(2i) (see A000041). - Jon Perry, Jun 06 2004
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = w^4 * (u^4 + v^4) - 2 * u^2 * v^6. - Michael Somos, Nov 01 2008
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u6^3 * (u1^2 + u3^2) - 2 * u1 * u2 * u3^3. - Michael Somos, Nov 01 2008
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u2^3 * (u3^2 - 3 * u1^2) + 2 * u1^3 * u3 * u6. - Michael Somos, Nov 01 2008
G.f. is a period 1 Fourier series which satisfies f(-1 / (16 t)) = 32^(-1/2) (t/i)^(-1/2) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A106507. - Michael Somos, Nov 01 2008
a(n) = 2*A014968(n), n >= 1. - Omar E. Pol, Jan 19 2014
a(n) ~ Pi * BesselI(3/2, Pi*sqrt(n)) / (4*sqrt(2)*n^(3/4)). - Vaclav Kotesovec, Jan 11 2017
Let T(n,k) = the number of partitions of n with parts 1 through k of two kinds, T(n,0) = A000041(n), the number of partitions of n. Then a(n) = T(n,0) + T(n-1,1) + T(n-3,2) + T(n-6,3) + T(n-10,4) + T(n-15,5) + ... .   Gregory L. Simay, May 29 2019
For n >= 1, a(n) = Sum_{k>=1} 2^k * A116608(n,k). - Gregory L. Simay, Jun 01 2019
Sum_{n>=1} 1/a(n) = A303662. - Amiram Eldar, Nov 15 2020
a(n) = Sum_{i=1..p(n)} 2^(d(n,i)), where d(n,i) is the number of distinct parts in the i-th partition of n. - Richard Joseph Boland, Sep 02 2021
G.f.: A(x) = exp( Sum_{n >= 1} x^n*(2 + x^n)/(n*(1 - x^(2*n))) ). - Peter Bala, Dec 23 2021
G.f. A(q) satisfies (3*A(q)/A(q^9) - 1)^3 = 9*A(q)^4/A(q^3)^4 - 1. - Paul D. Hanna, Oct 14 2024

Minor edits by Vaclav Kotesovec, Sep 13 2014

A067661 Number of partitions of n into distinct parts such that number of parts is even.

Original entry on oeis.org

1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 11, 13, 16, 19, 23, 27, 32, 38, 45, 52, 61, 71, 83, 96, 111, 128, 148, 170, 195, 224, 256, 292, 334, 380, 432, 491, 556, 630, 713, 805, 908, 1024, 1152, 1295, 1455, 1632, 1829, 2049, 2291, 2560, 2859, 3189, 3554, 3959, 4404

Offset: 0

Naohiro Nomoto, Feb 23 2002

Ramanujan theta functions: phi(q) (A000122), chi(q) (A000700).

			G.f. = 1 + x^3 + x^4 + 2*x^5 + 2*x^6 + 3*x^7 + 3*x^8 + 4*x^9 + 5*x^10 + ...
From _Gus Wiseman_, Jan 08 2021: (Start)
The a(3) = 1 through a(14) = 11 partitions (A-D = 10..13):
  21   31   32   42   43   53   54   64     65     75     76     86
            41   51   52   62   63   73     74     84     85     95
                      61   71   72   82     83     93     94     A4
                                81   91     92     A2     A3     B3
                                     4321   A1     B1     B2     C2
                                            5321   5421   C1     D1
                                                   6321   5431   5432
                                                          6421   6431
                                                          7321   6521
                                                                 7421
                                                                 8321
(End)

B. C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, see p. 18 Entry 9 Corollary (2).

Alois P. Heinz, Table of n, a(n) for n = 0..10000
Joerg Arndt, Matters Computational (The Fxtbook), end of section 16.4.2 "Partitions into distinct parts", pp.348ff
Mircea Merca, Combinatorial interpretations of a recent convolution for the number of divisors of a positive integer, Journal of Number Theory, Volume 160, March 2016, Pages 60-75, function q_e(n).
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Dominates A000009.
Numbers with these strict partitions as binary indices are A001969.
The non-strict case is A027187, ranked by A028260.
The Heinz numbers of these partitions are A030229.
The odd version is A067659, ranked by A030059.
The version for rank is A117192, with positive case A101708.
Other cases of even length:
- A024430 counts set partitions of even length.
- A034008 counts compositions of even length.
- A052841 counts ordered set partitions of even length.
- A174725 counts ordered factorizations of even length.
- A332305 counts strict compositions of even length
- A339846 counts factorizations of even length.
A008289 counts strict partitions by sum and length.
A026805 counts partitions whose least part is even.
Cf. A000700, A027193, A058696, A072233, A096373, A236913, A244990, A300061.

b:= proc(n, i, t) option remember; `if`(n>i*(i+1)/2, 0,
      `if`(n=0, t, add(b(n-i*j, i-1, abs(t-j)), j=0..min(n/i, 1))))
    end:
a:= n-> b(n$2, 1):
seq(a(n), n=0..80);  # Alois P. Heinz, Apr 01 2014

b[n_, i_, t_] := b[n, i, t] = If[n > i*(i + 1)/2, 0, If[n == 0, t, Sum[b[n - i*j, i - 1, Abs[t - j]], {j, 0, Min[n/i, 1]}]]]; a[n_] := b[n, n, 1]; Table[a[n], {n, 0, 80}] (* Jean-François Alcover, Jan 16 2015, after Alois P. Heinz *)
a[ n_] := SeriesCoefficient[ (QPochhammer[ -x, x] + QPochhammer[ x]) / 2, {x, 0, n}]; (* Michael Somos, May 06 2015 *)
Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&EvenQ[Length[#]]&]],{n,0,30}] (* Gus Wiseman, Jan 08 2021 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x^2 + A) / eta(x + A) + eta(x + A)) / 2, n))}; /* Michael Somos, Feb 14 2006 */

N=66;  q='q+O('q^N);  S=1+2*sqrtint(N);
gf=sum(n=0, S, (n%2==0) * q^(n*(n+1)/2) / prod(k=1, n, 1-q^k ) );
Vec(gf)  \\ Joerg Arndt, Apr 01 2014

G.f.: A(q) = Sum_{n >= 0} a(n) q^n = 1 + q^3 + q^4 + 2 q^5 + 2 q^6 + 3 q^7 + ... = Sum_{n >= 0} q^(n(2n+1))/(q; q){2n} [_Bill Gosper, Jun 25 2005]
Also, let B(q) = Sum_{n >= 0} A067659(n) q^n = q + q^2 + q^3 + q^4 + q^5 + 2 q^6 + ... Then B(q) = Sum_{n >= 0} q^((n+1)(2n+1))/(q; q)_{2n+1}.
Also we have the following identity involving 2 X 2 matrices:
Prod_{k >= 1} [ 1, q^k; q^k, 1 ] = [ A(q), B(q); B(q), A(q) ] [Bill Gosper, Jun 25 2005]
a(n) = (A000009(n)+A010815(n))/2. - Vladeta Jovovic, Feb 24 2002
Expansion of (1 + phi(-x)) / (2*chi(-x)) in powers of x where phi(), chi() are Ramanujan theta functions. - Michael Somos, Feb 14 2006
a(n) + A067659(n) = A000009(n). - R. J. Mathar, Jun 18 2016
a(n) ~ exp(Pi*sqrt(n/3)) / (8*3^(1/4)*n^(3/4)). - Vaclav Kotesovec, May 24 2018
A000009(n) = a(n) + A067659(n). - Gus Wiseman, Jan 09 2021
From Peter Bala, Feb 05 2021: (Start)
G.f.: A(x) = (1/2)*((Product_{n >= 0} 1 + x^n) + (Product_{n >= 0} 1 - x^n)).
Let B(x) denote the g.f. of A067659. Then
A(x)^2 - B(x)^2 = A(x^2) - B(x^2) = Product_{n >= 1} 1 - x^(2*n) = Sum_{n in Z} (-1)^n*x^(n*(3*n+1)).
A(x) + B(x) is the g.f. of A000009.
1/(A(x) - B(x)) is the g.f. of A000041.
(A(x) + B(x))/(A(x) - B(x)) is the g.f. of A015128.
A(x)/(A(x) + B(x)) = Sum_{n >= 0} (-1)^n*x^n^2 = (1 + theta_3(-x))/2.
B(x)/(A(x) - B(x)) is the g.f. of A014968.
A(x)/(A(x^2) - B(x^2)) is the g.f. of A027187.
B(x)/(A(x^2) - B(x^2)) is the g.f. of A027193. (End)

A338223 G.f.: (1 / theta_4(x) - 1)^2 / 4, where theta_4() is the Jacobi theta function.

Original entry on oeis.org

1, 4, 12, 30, 68, 144, 289, 556, 1034, 1868, 3292, 5678, 9608, 15984, 26188, 42314, 67509, 106460, 166090, 256552, 392628, 595696, 896484, 1338894, 1985298, 2923840, 4278448, 6222518, 8997544, 12938368, 18507297, 26340040, 37307326, 52597320, 73825504, 103180702

Offset: 2

Ilya Gutkovskiy, Jan 30 2021

nonn

Alois P. Heinz, Table of n, a(n) for n = 2..10000

Cf. A001934, A002448, A014968, A015128, A048574, A063725, A327380.

g:= proc(n, i) option remember; `if`(n=0, 1/2, `if`(i=1, 0,
      g(n, i-1))+add(2*g(n-i*j, i-1), j=`if`(i=1, n, 1)..n/i))
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
      g(n$2)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 2):
seq(a(n), n=2..37);  # Alois P. Heinz, Feb 10 2021

nmax = 37; CoefficientList[Series[(1/EllipticTheta[4, 0, x] - 1)^2/4, {x, 0, nmax}], x] // Drop[#, 2] &
nmax = 37; CoefficientList[Series[(1/4) (-1 + Product[(1 + x^k)/(1 - x^k), {k, 1, nmax}])^2, {x, 0, nmax}], x] // Drop[#, 2] &
A015128[n_] := Sum[PartitionsP[k] PartitionsQ[n - k], {k, 0, n}]; a[n_] := (1/4) Sum[A015128[k] A015128[n - k], {k, 1, n - 1}]; Table[a[n], {n, 2, 37}]

G.f.: (1/4) * (-1 + Product_{k>=1} (1 + x^k) / (1 - x^k))^2.
a(n) = Sum_{k=0..n} A014968(k) * A014968(n-k).
a(n) = (1/4) * Sum_{k=1..n-1} A015128(k) * A015128(n-k).
a(n) = (A001934(n) - 2 * A015128(n)) / 4 for n > 0.

A341364 Expansion of (1 / theta_4(x) - 1)^3 / 8.

Original entry on oeis.org

1, 6, 24, 77, 216, 552, 1315, 2964, 6387, 13255, 26640, 52074, 99336, 185430, 339483, 610709, 1081227, 1886484, 3247502, 5521365, 9279624, 15429149, 25397088, 41412030, 66928700, 107265576, 170556654, 269164346, 421765920, 656419080, 1015044526, 1559950185, 2383284894

Offset: 3

Ilya Gutkovskiy, Feb 10 2021

nonn

Alois P. Heinz, Table of n, a(n) for n = 3..10000

Cf. A002448, A004404, A014968, A015128, A063691, A319552, A327381, A338223, A341221, A341365, A341366, A341367, A341368, A341369, A341370.

g:= proc(n, i) option remember; `if`(n=0, 1/2, `if`(i=1, 0,
      g(n, i-1))+add(2*g(n-i*j, i-1), j=`if`(i=1, n, 1)..n/i))
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
      g(n$2)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 3):
seq(a(n), n=3..35);  # Alois P. Heinz, Feb 10 2021

nmax = 35; CoefficientList[Series[(1/EllipticTheta[4, 0, x] - 1)^3/8, {x, 0, nmax}], x] // Drop[#, 3] &
nmax = 35; CoefficientList[Series[(1/8) (-1 + Product[(1 + x^k)/(1 - x^k), {k, 1, nmax}])^3, {x, 0, nmax}], x] // Drop[#, 3] &

G.f.: (1/8) * (-1 + Product_{k>=1} (1 + x^k) / (1 - x^k))^3.

a(n) ~ A319552(n)/8 ~ 3*exp(Pi*sqrt(3*n)) / (512*n^(3/2)). - Vaclav Kotesovec, Feb 20 2021

A341365 Expansion of (1 / theta_4(x) - 1)^4 / 16.

Original entry on oeis.org

1, 8, 40, 156, 520, 1552, 4262, 10960, 26716, 62276, 139744, 303412, 640001, 1315832, 2644004, 5204044, 10052182, 19086348, 35672516, 65708116, 119409576, 214289116, 380068582, 666723748, 1157550524, 1990230968, 3390558072, 5726064688, 9590759624, 15938198484, 26289242026

Offset: 4

Ilya Gutkovskiy, Feb 10 2021

nonn

Robert Israel, Table of n, a(n) for n = 4..10000

Cf. A002448, A004405, A014968, A015128, A063730, A284286, A327382, A338223, A341222, A341364, A341366, A341367, A341368, A341369, A341370.

g:= proc(n, i) option remember; `if`(n=0, 1/2, `if`(i=1, 0,
      g(n, i-1))+add(2*g(n-i*j, i-1), j=`if`(i=1, n, 1)..n/i))
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
      g(n$2)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 4):
seq(a(n), n=4..34);  # Alois P. Heinz, Feb 10 2021

nmax = 34; CoefficientList[Series[(1/EllipticTheta[4, 0, x] - 1)^4/16, {x, 0, nmax}], x] // Drop[#, 4] &
nmax = 34; CoefficientList[Series[(1/16) (-1 + Product[(1 + x^k)/(1 - x^k), {k, 1, nmax}])^4, {x, 0, nmax}], x] // Drop[#, 4] &

G.f.: (1/16) * (-1 + Product_{k>=1} (1 + x^k) / (1 - x^k))^4.

a(n) ~ A284286(n)/16. - Vaclav Kotesovec, Feb 20 2021

A341368 Expansion of (1 / theta_4(x) - 1)^7 / 128.

Original entry on oeis.org

1, 14, 112, 665, 3248, 13776, 52437, 183080, 595399, 1824109, 5310144, 14787542, 39605363, 102465972, 257005641, 626841236, 1490521109, 3462881324, 7875519169, 17562223791, 38456245849, 82793422502, 175452110162, 366348547908, 754392685046, 1533283745644, 3078157040665

Offset: 7

Ilya Gutkovskiy, Feb 10 2021

nonn

Alois P. Heinz, Table of n, a(n) for n = 7..10000

Cf. A002448, A004408, A014968, A015128, A327385, A338223, A340906, A341226, A341364, A341365, A341366, A341367, A341369, A341370.

g:= proc(n, i) option remember; `if`(n=0, 1/2, `if`(i=1, 0,
      g(n, i-1))+add(2*g(n-i*j, i-1), j=`if`(i=1, n, 1)..n/i))
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
      g(n$2)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 7):
seq(a(n), n=7..33);  # Alois P. Heinz, Feb 10 2021

nmax = 33; CoefficientList[Series[(1/EllipticTheta[4, 0, x] - 1)^7/128, {x, 0, nmax}], x] // Drop[#, 7] &
nmax = 33; CoefficientList[Series[(1/128) (-1 + Product[(1 + x^k)/(1 - x^k), {k, 1, nmax}])^7, {x, 0, nmax}], x] // Drop[#, 7] &

G.f.: (1/128) * (-1 + Product_{k>=1} (1 + x^k) / (1 - x^k))^7.

A341369 Expansion of (1 / theta_4(x) - 1)^8 / 256.

Original entry on oeis.org

1, 16, 144, 952, 5136, 23904, 99292, 376512, 1324376, 4372632, 13673888, 40787848, 116713350, 321861312, 858693192, 2223428224, 5602833292, 13772292360, 33089930724, 77846837848, 179602530648, 406914172336, 906438716196, 1987418937952, 4293164981849, 9144987747024

Offset: 8

Ilya Gutkovskiy, Feb 10 2021

nonn

Alois P. Heinz, Table of n, a(n) for n = 8..10000

Cf. A002448, A004409, A014968, A015128, A319553, A327386, A338223, A340915, A341227, A341364, A341365, A341366, A341367, A341368, A341370.

g:= proc(n, i) option remember; `if`(n=0, 1/2, `if`(i=1, 0,
      g(n, i-1))+add(2*g(n-i*j, i-1), j=`if`(i=1, n, 1)..n/i))
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
      g(n$2)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 8):
seq(a(n), n=8..33);  # Alois P. Heinz, Feb 10 2021

nmax = 33; CoefficientList[Series[(1/EllipticTheta[4, 0, x] - 1)^8/256, {x, 0, nmax}], x] // Drop[#, 8] &
nmax = 33; CoefficientList[Series[(1/256) (-1 + Product[(1 + x^k)/(1 - x^k), {k, 1, nmax}])^8, {x, 0, nmax}], x] // Drop[#, 8] &

G.f.: (1/256) * (-1 + Product_{k>=1} (1 + x^k) / (1 - x^k))^8.

A341370 Expansion of (1 / theta_4(x) - 1)^9 / 512.

Original entry on oeis.org

1, 18, 180, 1311, 7740, 39204, 176388, 721530, 2728053, 9651056, 32246892, 102515508, 311923386, 912771468, 2579132196, 7060677537, 18781247700, 48660380190, 123061973176, 304351869708, 737293187286, 1752035386188, 4089222211212, 9384936015492, 21201250825554

Offset: 9

Ilya Gutkovskiy, Feb 10 2021

nonn

Alois P. Heinz, Table of n, a(n) for n = 9..10000

Cf. A002448, A004410, A014968, A015128, A327387, A338223, A340946, A341228, A341364, A341365, A341366, A341367, A341368, A341369.

g:= proc(n, i) option remember; `if`(n=0, 1/2, `if`(i=1, 0,
      g(n, i-1))+add(2*g(n-i*j, i-1), j=`if`(i=1, n, 1)..n/i))
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, `if`(n=0, 0,
      g(n$2)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n, 9):
seq(a(n), n=9..33);  # Alois P. Heinz, Feb 10 2021

nmax = 33; CoefficientList[Series[(1/EllipticTheta[4, 0, x] - 1)^9/512, {x, 0, nmax}], x] // Drop[#, 9] &
nmax = 33; CoefficientList[Series[(1/512) (-1 + Product[(1 + x^k)/(1 - x^k), {k, 1, nmax}])^9, {x, 0, nmax}], x] // Drop[#, 9] &

G.f.: (1/512) * (-1 + Product_{k>=1} (1 + x^k) / (1 - x^k))^9.

A265835 Numbers n such that A015128(n)/2 is prime.

Original entry on oeis.org

2, 4, 16, 36, 400, 1296, 1521, 52441

Offset: 1

Vaclav Kotesovec, Dec 16 2015

Next term, if it exists, is greater than 4000000. - Vaclav Kotesovec, updated Apr 12 2017

The values of a(n) are the squares of these integers for 1 < n < 9: 2, 4, 6, 20, 36, 39, 229. Squares also appear in the sequence of numbers k such that A015128(k)/2 is semiprime. - Altug Alkan, Dec 16 2015

			4 is a term because A015128(4)/2 = 14/2 = 7 is prime.

Cf. A014968, A015128, A035359, A046063, A299961.

Select[Range[2000], PrimeQ[Sum[PartitionsP[#-k]*PartitionsQ[k], {k, 0, #}]/2] &]

a015128(n) = polcoeff(exp(sum(m=1, n\2+1, 2*x^(2*m-1)/(1-x^(2*m-1)+x*O(x^n))/(2*m-1))), n);
for(n=1, 1e3, if(ispseudoprime(a015128(n)/2), print1(n, ", "))) \\ Altug Alkan, Dec 16 2015

A277974 Expansion of ((Product_{n>=1} (1 - x^(5*n))/(1 - x^n)^5) - 1)/5 in powers of x.

Original entry on oeis.org

0, 1, 4, 13, 38, 101, 252, 594, 1340, 2907, 6104, 12447, 24744, 48068, 91476, 170838, 313646, 566824, 1009628, 1774290, 3079338, 5282172, 8962288, 15050848, 25032420, 41255101, 67406472, 109236685, 175654072, 280371510, 444372452, 699579062, 1094289564

Offset: 0

Seiichi Manyama, Nov 07 2016

nonn

			G.f. = x + 4*x^2 + 13*x^3 + 38*x^4 + 101*x^5 + 252*x^6 + ...

Seiichi Manyama, Table of n, a(n) for n = 0..1000

Cf. Expansion of ((Product_{n>=1} (1 - x^(k*n))/(1 - x^n)^k) - 1)/k in powers of x: A014968 (k=2), A277968 (k=3), this sequence (k=5), A160549 (k=7), A277912 (k=11).

nmax = 50; CoefficientList[Series[(Product[(1 - x^(5*j))/(1 - x^j)^5, {j, 1, nmax}] - 1)/5, {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 10 2016 *)
a[ n_] := SeriesCoefficient[ (QPochhammer[ x^5] / QPochhammer[ x]^5 - 1) / 5, {x, 0, n}]; (* Michael Somos, Nov 13 2016 *)

x='x+O('x^66); concat([0],Vec(eta(x^5)/eta(x)^5-1)/5) \\ Joerg Arndt, Nov 27 2016

a(n) = A277212(n)/5, n > 0.
G.f.: ((Product_{n>=1} (1 - x^(5*n))/(1 - x^n)^5) - 1)/5.
a(n) ~ exp(4*Pi*sqrt(n/5)) / (sqrt(2) * 5^(11/4) * n^(7/4)). - Vaclav Kotesovec, Nov 10 2016

cp's OEIS Frontend

A015128 Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Julia

Maple

Mathematica

PARI

PARI

PARI

PARI

SageMath

Formula

Extensions

A067661 Number of partitions of n into distinct parts such that number of parts is even.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A338223 G.f.: (1 / theta_4(x) - 1)^2 / 4, where theta_4() is the Jacobi theta function.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A341364 Expansion of (1 / theta_4(x) - 1)^3 / 8.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A341365 Expansion of (1 / theta_4(x) - 1)^4 / 16.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A341368 Expansion of (1 / theta_4(x) - 1)^7 / 128.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A341369 Expansion of (1 / theta_4(x) - 1)^8 / 256.

Views

Author

Keywords