A002513 -id:A002513 - 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

A001934 Expansion of 1/theta_4(q)^2 in powers of q.

Original entry on oeis.org

1, 4, 12, 32, 76, 168, 352, 704, 1356, 2532, 4600, 8160, 14176, 24168, 40512, 66880, 108876, 174984, 277932, 436640, 679032, 1046016, 1597088, 2418240, 3632992, 5417708, 8022840, 11802176, 17252928, 25070568, 36223424, 52053760, 74414412

Offset: 0

N. J. A. Sloane, Simon Plouffe

Euler transform of period 2 sequence [ 4, 2, ...].
The Cayley reference actually is to A004403. - Michael Somos, Feb 24 2011
Number of overpartition pairs, see Lovejoy reference. - _Joerg Arndt, Apr 03 2011
In general, if g.f. = Product_{k>=1} ((1+x^k)/(1-x^k))^m and m>=1, then a(n) ~ exp(Pi*sqrt(m*n)) * m^((m+1)/4) / (2^(3*(m+1)/2) * n^((m+3)/4)). - Vaclav Kotesovec, Aug 17 2015

A. Cayley, A memoir on the transformation of elliptic functions, Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 9, p. 128.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi and Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Vincenzo Librandi)
A. Cayley, A memoir on the transformation of elliptic functions, Philosophical Transactions of the Royal Society of London (1874): 397-456; Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, included in Vol. 9. [Annotated scan of pages 126-129]
B. 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], Sep 30 2015, p. 8.
Jeremy Lovejoy, Overpartition pairs, Annales de l'institut Fourier, vol.56, no.3, p.781-794, 2006.

Cf. A000122, A000203, A004403, A002318, A002513, A015128, A004404-A004425.

# JacobiTheta4 is defined in A002448.
A001934List(len) = JacobiTheta4(len, -2)
A001934List(33) |> println # Peter Luschny, Mar 12 2018

Maple
```
mul((1+x^n)^2/(1-x^n)^2,n=1..256);
```

CoefficientList[Series[1/EllipticTheta[4, 0, q]^2, {q, 0, 32}], q]  (* Jean-François Alcover, Jul 18 2011 *)
nmax = 40; CoefficientList[Series[Product[((1 + x^k)/(1 - x^k))^2, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 17 2015 *)
QP = QPochhammer; s = QP[q^2]^2/QP[q]^4 + O[q]^40; CoefficientList[s, q] (* Jean-François Alcover, Dec 01 2015, adapted from PARI *)

my(N=33, x='x+O('x^N)); Vec(prod(i=1, N, (1+x^i)^2/(1-x^i)^2))

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

G.f.: Product ( 1 - x^k )^{-c(k)}, c(k) = 4, 2, 4, 2, 4, 2, ....
G.f.: Product{i>=1} (1+x^i)^2/(1-x^i)^2. - Jon Perry, Apr 04 2004
Expansion of eta(q^2)^2/eta(q)^4 in powers of q, where eta(x)=prod(n>=1,1-q^n).
a(n) = (-1)^n * A004403(n). a(n) = 4 * A002318(n) unless n=0. - Michael Somos, Feb 24 2011
a(n) ~ exp(Pi*sqrt(2*n)) / (2^(15/4) * n^(5/4)) * (1 - 15/(8*Pi*sqrt(2*n)) + 105/(256*Pi^2*n)). - Vaclav Kotesovec, Aug 17 2015, extended Jan 22 2017
a(0) = 1, a(n) = (4/n)*Sum_{k=1..n} A002131(k)*a(n-k) for n > 0. - Seiichi Manyama, May 02 2017
G.f.: exp(2*Sum_{k>=1} (sigma(2*k) - sigma(k))*x^k/k). - Ilya Gutkovskiy, Sep 19 2018
The g.f. A(q^2) = 1/(F(q)*F(-q)), where F(q) = theta_3(q) = Sum_{n = -oo..oo} q^(n^2) is the g.f. of A000122. Cf. A002513. - Peter Bala, Sep 26 2023

More terms from James Sellers, Sep 08 2000

Edited by N. J. A. Sloane, May 13 2008 to remove an incorrect g.f.

A030204 Expansion of q^(-1/8) * eta(q) * eta(q^2) in powers of q.

Original entry on oeis.org

1, -1, -2, 1, 0, 2, 1, 0, 0, -2, 1, -2, -2, 0, 2, -1, 0, 2, 0, 2, 0, 1, 0, 0, -2, 0, 0, 0, -1, -2, -2, 0, 2, 0, 0, -2, 3, 0, 0, 2, 0, 0, 2, 0, 2, -1, -2, 0, 0, 0, -2, 2, 0, -2, -2, -1, -2, 2, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 2, 2, 0, 2, -2, 0, -2, 1, 0

Offset: 0

N. J. A. Sloane

sign

Number 66 of the 74 eta-quotients listed in Table I of Martin (1996).
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
A030204, A083650 and A138514 are the same except for signs. - N. J. A. Sloane, May 07 2010

			G.f. = 1 - x - 2*x^2 + x^3 + 2*x^5 + x^6 - 2*x^9 + x^10 - 2*x^11 - 2*x^12 + ...
G.f. = q - q^9 - 2*q^17 + q^25 + 2*q^41 + q^49 - 2*q^73 + q^81 - 2*q^89 - 2*q^97 + ...

Seiichi Manyama, Table of n, a(n) for n = 0..10000
S. R. Finch, Powers of Euler's q-Series, arXiv:math/0701251 [math.NT], 2007.
M. Koike, On McKay's conjecture, Nagoya Math. J., 95 (1984), 85-89.
Y. Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
Michael Somos, Index to Yves Martin's list of 74 multiplicative eta-quotients and their A-numbers
Michael Somos, Introduction to Ramanujan theta functions
J. B. Tunnell, A classical Diophantine problem and modular forms of weight 3/2, Invent. Math., 72 (1983), 323-334. [a(n) = coefficient of q^(9m+1) in the q-expansion of the unique normalized newform g of weight 1, level 128, and character chi_2. - _N. J. A. Sloane_, Oct 18 2014]
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A000203, A002513, A107063, A107064, A138514.

Basis( CuspForms( Gamma1(128), 1), 641)[1]; /* Michael Somos, Jan 31 2015 */

a[ n_] := SeriesCoefficient[ QPochhammer[ x] QPochhammer[ x^2], {x, 0, n}]; (* Michael Somos, Oct 11 2013 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x]^2 / QPochhammer[ x, x^2], {x, 0, n}]; (* Michael Somos, Oct 11 2013 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 4, 0, x] EllipticTheta[ 2, 0, x^(1/2)] / (2 x^(1/8)), {x, 0, n}]; (* Michael Somos, Oct 11 2013 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 2, 0, x] EllipticTheta[ 2, 0, I x] / (4 Sqrt[ x] I^(1/4)), {x, 0, 4 n}]; (* Michael Somos, Oct 11 2013 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 2, 0, x] EllipticTheta[ 2, Pi/4, x] / (2^(3/2) x^(1/2)), {x, 0, 4 n}]; (* Michael Somos, Jan 31 2015 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A) * eta(x^2 + A), n))};

{a(n) = my(A, p, e); if( n<0, 0, n = 8*n + 1; A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k,]; if( p==2, 0, p%8==1, (e + 1) * if( qfbclassno(-4*p)%8, (-1)^e, 1), e%2==0, (-1)^(e/2*(p%8<5)))))}; /* Michael Somos, Jul 26 2006 */

{a(n) = if( n<0, 0, n = 8*n + 1; (qfrep([1, 0;0, 32], n) - qfrep([4, 2; 2, 9], n))[n])}; /* Michael Somos, Sep 02 2006 */

G.f.: Product_{k>0} (1 - x^k) * (1 - x^(2*k)).
G.f.: (Sum_{k>0} x^((k^2 - k)/2)) * (Sum_{k in Z} (-1)^k * x^k^2). - Michael Somos, Sep 02 2006
Expansion of psi(x) * phi(-x) = f(-x^2) * f(-x) = f(-x)^2 / chi(-x) = f(-x)^3 / phi(-x) = f(-x^2)^2 * chi(-x) = f(-x^2)^3 / psi(x) = psi(-x) * phi(-x^2) = psi(x)^2 * chi(-x)^3 = phi(-x)^2 / chi(-x)^3 = (f(-x)^3 * psi(x))^(1/2) = (f(-x^2)^3 * phi(-x))^(1/2) in powers of x where phi(), psi(), chi(), f() are Ramanujan theta functions. - Michael Somos, Mar 22 2008
Expansion of psi(x) * psi(-x) in powers of x^2 where psi() is a Ramanujan theta function. - Michael Somos, Oct 11 2013
Euler transform of period 2 sequence [ -1, -2, ...].
a(3*n) = A107063(n). a(3*n + 2) = -2 * A107064(n). - Michael Somos, Oct 11 2013
a(9*n + 1) = -a(n), a(9*n + 4) = a(9*n + 7) = 0. - Michael Somos, Mar 17 2004
a(n) = b(8*n + 1) where b(n) is multiplicative and b(2^e) = 0^e, b(p^e) = 0 if p === 3,5,7 (mod 8) and e odd, b(p^e) = (-1)^(e/2) if p == 3 (mod 8) and e even, b(p^e) = 1 if p == 5,7 (mod 8) and e even, b(p^e) = e + 1 if p == 1 (mod 8) and p = x^2 + 32*y^2, b(p^e) = (-1)^e * (e + 1) if p == 1 (mod 8) and p is not of the form x^2 + 32*y^2.
a(n) = (-1)^n * A138514(n). Convolution inverse is A002513.
G.f.: exp(Sum_{k>=1} (sigma(2*k) - 4*sigma(k))*x^k/k). - Ilya Gutkovskiy, Sep 19 2018

A246584 Number of overcubic partitions of n.

Original entry on oeis.org

1, 2, 6, 12, 26, 48, 92, 160, 282, 470, 784, 1260, 2020, 3152, 4896, 7456, 11290, 16836, 24962, 36556, 53232, 76736, 110012, 156384, 221156, 310482, 433776, 602200, 832224, 1143696, 1565088, 2131072, 2890266, 3902344, 5249356, 7032576, 9389022, 12488368

Offset: 0

N. J. A. Sloane, Sep 03 2014

nonn

Convolution of A001935 and A002513. - Vaclav Kotesovec, Aug 16 2019

Alois P. Heinz, Table of n, a(n) for n = 0..10000
Michael D. Hirschhorn, A note on overcubic partitions, New Zealand J. Math., 42:229-234, 2012.
Bernard L. S. Lin, Arithmetic properties of overcubic partition pairs, Electronic Journal of Combinatorics 21(3) (2014), #P3.35.
James A. Sellers, Elementary proofs of congruences for the cubic and overcubic partition functions, Australasian Journal of Combinatorics, 60(2) (2014), 191-197.

Trisections: A246585, A246586, A246587.

# to get 140 terms:
ph:=add(q^(n^2),n=-12..12);
ph:=series(ph,q,140);
g1:=1/(subs(q=-q,ph)*subs(q=-q^2,ph));
g1:=series(g1,q,140);
seriestolist(%);
# second Maple program:
with(numtheory):
a:= proc(n) option remember; `if`(n=0, 1, add(a(n-j)*add(d*
      `if`(irem(d, 4)=2, 3, 2), d=divisors(j)), j=1..n)/n)
    end:
seq(a(n), n=0..40);  # Alois P. Heinz, Aug 17 2019

nmax = 50; CoefficientList[Series[Product[(1+x^k) * (1+x^(2*k)) / ((1-x^k) * (1-x^(2*k))), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 16 2019 *)
nmax = 50; CoefficientList[Series[Product[(1+x^(2*k)) / (1-x^k)^2, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 16 2019 *)

G.f.: Product_{k>=1} (1+x^k) * (1+x^(2*k)) / ((1-x^k) * (1-x^(2*k))). - Vaclav Kotesovec, Aug 16 2019

a(n) ~ 3^(3/4) * exp(sqrt(3*n/2)*Pi) / (2^(19/4)*n^(5/4)). - Vaclav Kotesovec, Aug 16 2019

A215947 Difference between the sum of the even divisors and the sum of the odd divisors of 2n.

Original entry on oeis.org

1, 5, 4, 13, 6, 20, 8, 29, 13, 30, 12, 52, 14, 40, 24, 61, 18, 65, 20, 78, 32, 60, 24, 116, 31, 70, 40, 104, 30, 120, 32, 125, 48, 90, 48, 169, 38, 100, 56, 174, 42, 160, 44, 156, 78, 120, 48, 244, 57, 155, 72, 182, 54, 200, 72, 232, 80, 150, 60, 312, 62, 160

Offset: 1

Michel Lagneau, Aug 28 2012

Multiplicative because a(n) = -A002129(2*n), A002129 is multiplicative and a(1) = -A002129(2) = 1. - Andrew Howroyd, Jul 31 2018

			a(6) = 20 because the divisors of 2*6 = 12 are {1, 2, 3, 4, 6, 12} and (12 + 6 + 4 +2) - (3 + 1) = 20.

Michel Lagneau, Table of n, a(n) for n = 1..10000
Hartosh Singh Bal and Gaurav Bhatnagar, Two curious congruences for the sum of divisors function, arXiv:2102.10804 [math.NT], 2021. Mentions this sequence.
H. Movasati and Y. Nikdelan, Gauss-Manin Connection in Disguise: Dwork Family, arXiv preprint arXiv:1603.09411 [math.AG], 2016-2017.

Cf. A000593, A002129, A022998 (Moebius transform), A074400, A195382, A195690.

Cf. A002513, A062731, A111003, A239050.

with(numtheory):for n from 1 to 100 do:x:=divisors(2*n):n1:=nops(x):s0:=0:s1:=0:for m from 1 to n1 do: if irem(x[m],2)=0 then s0:=s0+x[m]:else s1:=s1+x[m]:fi:od:if s0>s1  then printf(`%d, `,s0-s1):else fi:od:

a[n_] := DivisorSum[2n, (1 - 2 Mod[#, 2]) #&];
Array[a, 62] (* Jean-François Alcover, Sep 13 2018 *)
edod[n_]:=Module[{d=Divisors[2n]},Total[Select[d,EvenQ]]-Total[ Select[ d,OddQ]]]; Array[edod,70] (* Harvey P. Dale, Jul 30 2021 *)

a(n) = 4*sigma(n) - sigma(2*n); \\ Andrew Howroyd, Jul 28 2018

From Andrew Howroyd, Jul 28 2018: (Start)
a(n) = 4*sigma(n) - sigma(2*n).
a(n) = -A002129(2*n). (End)
G.f.: Sum_{k>=1} x^k*(1 + 4*x^k + x^(2*k))/(1 - x^(2*k))^2. - Ilya Gutkovskiy, Sep 14 2019
a(p) = p + 1 for p prime >= 3. - Bernard Schott, Sep 14 2019
a(n) = A239050(n) - A062731(n) - Omar E. Pol, Mar 06 2021 (after Andrew Howroyd)
From Amiram Eldar, Nov 18 2022: (Start)
Multiplicative with a(2^e) = 2^(e+2) - 3, and a(p^e) = sigma(p^e) = (p^(e+1) - 1)/(p-1) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^2, where c = Pi^2/8 = 1.2337005... (A111003). (End)
Dirichlet g.f.: zeta(s)*zeta(s-1)*(1+2^(1-s)). - Amiram Eldar, Jan 05 2023
From Peter Bala, Sep 25 2023: (Start)
a(2*n) = sigma(2*n) + 2*sigma(n); a(2*n+1) = sigma(2*n+1) = A008438(n)
G.f.: A(q) = Sum_{n >= 1} n*q^n*(1 + 3*q^n)/(1 - q^(2*n)).
Logarithmic g.f.: Sum_{n >= 1} a(n)*q^n/n = Sum_{n >= 1} log(1/(1 - q^n)) + Sum_{n >= 1} log(1/(1 - q^(2*n))) = log (G(q)), where G(q) is the g.f. of A002513. (End)

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

A001934 Expansion of 1/theta_4(q)^2 in powers of q.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Julia

Maple

Mathematica

PARI

PARI

Formula

Extensions

A030204 Expansion of q^(-1/8) * eta(q) * eta(q^2) in powers of q.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

PARI

Formula

A246584 Number of overcubic partitions of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A215947 Difference between the sum of the even divisors and the sum of the odd divisors of 2n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A358369 Euler transform of 2^floor(n/2), (A016116).

Views

Author

Keywords

A327042 Expansion of Product_{k>=1} 1/((1 - x^k) * (1 - x^(2k)) (1 - x^(3*k))).

A327043 Expansion of Product_{k>=1} 1/((1 - x^k) * (1 - x^(2k)) (1 - x^(3k)) (1 - x^(4*k))).

A327044 Expansion of Product_{k>=1} 1/((1 - x^k) * (1 - x^(2k)) (1 - x^(3k)) (1 - x^(4k)) (1 - x^(5*k))).

A319455 Expansion of Product_{k>=1} 1/((1 - x^k)(1 - x^(2k)))^2.