Search: a303662 -id:a303662
|
|
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.
|
|
+10
190
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The over-partition function.
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
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
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
|
|
REFERENCES
|
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.
|
|
LINKS
|
Sylvie Corteel and Jeremy Lovejoy, Overpartitions, Trans. Amer. Math. Soc., 356 (2004), 1623-1635.
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.
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.
|
|
FORMULA
|
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
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
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. 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) ~ 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
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
|
|
EXAMPLE
|
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
|
|
MAPLE
|
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):
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
|
|
MATHEMATICA
|
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 *)
Table[Sum[PartitionsP[n-k]*PartitionsQ[k], {k, 0, n}], {n, 0, 50}] (* Vaclav Kotesovec, Nov 28 2015 *)
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 *)
|
|
PROG
|
(PARI) {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 */
(PARI) {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 */
(PARI) 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 */
(PARI) lista(nn) = {q='q+O('q^nn); Vec(eta(q^2)/eta(q)^2)} \\ Altug Alkan, Mar 20 2018
(Julia) # JacobiTheta4 is defined in A002448.
A015128List(len) = JacobiTheta4(len, -1)
(SageMath) # uses[EulerTransform from A166861]
a = BinaryRecurrenceSequence(0, 1, 1, 2)
b = EulerTransform(a)
|
|
CROSSREFS
|
See A004402 for a version with signs.
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A078506
|
|
Decimal expansion of sum of inverses of unrestricted partition function.
|
|
+10
7
|
|
|
2, 5, 1, 0, 5, 9, 7, 4, 8, 3, 8, 8, 6, 2, 9, 3, 9, 5, 3, 2, 3, 6, 8, 3, 4, 7, 2, 7, 4, 1, 5, 4, 6, 5, 4, 5, 1, 6, 8, 3, 5, 3, 1, 9, 4, 4, 9, 5, 5, 1, 4, 7, 6, 8, 1, 9, 0, 8, 0, 6, 2, 9, 9, 6, 5, 0, 8, 3, 8, 4, 5, 3, 2, 9, 0, 4, 4, 6, 1, 8, 4, 2, 3, 8, 1, 9, 2, 5, 8, 7, 1, 4, 6, 2, 8, 2, 7, 8, 0, 9
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Conjecture: this is a transcendental number. - Zhi-Wei Sun, May 24 2023
|
|
LINKS
|
|
|
FORMULA
|
Sum_{n>=1} 1/A000041(n) = 2.510597483886...
|
|
EXAMPLE
|
2.510597483886293953236834727415465451683531944955147681908...
|
|
MATHEMATICA
|
digits = 100; NSum[1/PartitionsP[n], {n, 1, Infinity}, NSumTerms -> 10000, WorkingPrecision -> digits+1] // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Feb 21 2014 *)
|
|
PROG
|
(PARI)
default(realprecision, 100);
N=10000; x='x+O('x^N);
v=Vec(Ser( 1/eta(x) ) );
s=sum(n=2, #v, 1.0/v[n] )
(PARI) {a(n) = if( n<-1, 0, n++; default( realprecision, n+5); floor( suminf( k=1, 1 / numbpart(k)) * 10^n) % 10)} /* Michael Somos, Feb 05 2011 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Corrected digits from position 32 on by Ralf Stephan, Jan 24 2011
|
|
STATUS
|
approved
|
|
|
|
|
A237515
|
|
Decimal expansion of the sum of reciprocals of the strict partition function (the function giving the number of partitions of an integer into distinct parts).
|
|
+10
4
|
|
|
4, 6, 7, 3, 4, 4, 4, 5, 7, 9, 3, 1, 6, 3, 4, 5, 1, 7, 5, 0, 3, 3, 4, 1, 7, 4, 3, 4, 6, 1, 1, 3, 0, 5, 3, 9, 8, 5, 8, 9, 7, 0, 3, 9, 9, 3, 6, 9, 8, 9, 3, 1, 2, 3, 8, 6, 7, 4, 0, 5, 2, 2, 0, 2, 1, 5, 6, 9, 9, 9, 5, 7, 1, 2, 2, 0, 1, 9, 7, 0, 7, 7, 3, 4, 6, 2, 5, 0, 3, 9, 7, 7, 3, 1, 7, 1, 7, 4, 8, 5
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Conjecture: This number is transcendental. - Zhi-Wei Sun, May 24 2023
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
4.6734445793163451750334174346113053985897...
|
|
MATHEMATICA
|
digits = 100; NSum[1/PartitionsQ[n], {n, 1, Infinity}, NSumTerms -> 15000, WorkingPrecision -> digits+1] // RealDigits[#, 10, digits]& // First
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.007 seconds
|