cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A000025 Coefficients of the 3rd-order mock theta function f(q).

Original entry on oeis.org

1, 1, -2, 3, -3, 3, -5, 7, -6, 6, -10, 12, -11, 13, -17, 20, -21, 21, -27, 34, -33, 36, -46, 51, -53, 58, -68, 78, -82, 89, -104, 118, -123, 131, -154, 171, -179, 197, -221, 245, -262, 279, -314, 349, -369, 398, -446, 486, -515, 557, -614, 671, -715, 767, -845, 920, -977, 1046, -1148, 1244
Offset: 0

Views

Author

Keywords

Comments

a(n) = number of partitions of n with even rank minus number with odd rank. The rank of a partition is its largest part minus the number of parts.

Examples

			G.f. = 1 + q - 2*q^2 + 3*q^3 - 3*q^4 + 3*q^5 - 5*q^6 + 7*q^7 - 6*q^8 + 6*q^9 + ...
		

References

  • G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 82, Examples 4 and 5.
  • Srinivasa Ramanujan, Collected Papers, Chelsea, New York, 1962, pp. 354-355
  • Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, pp. 17, 31.
  • 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).

Crossrefs

Other '3rd-order' mock theta functions are at A013953, A053250, A053251, A053252, A053253, A053254, A053255. See also A000039, A000199.

Programs

  • Maple
    a:= m-> coeff(series((1+4*add((-1)^n*q^(n*(3*n+1)/2)/
            (1+q^n), n=1..m))/mul(1-q^i, i=1..m), q, m+1), q, m):
    seq(a(n), n=0..120);
  • Mathematica
    CoefficientList[Series[(1+4Sum[(-1)^n q^(n(3n+1)/2)/(1+q^n), {n, 1, 10}])/Sum[(-1)^n q^(n(3n+1)/2), {n, -8, 8}], {q, 0, 100}], q] (* N. J. A. Sloane *)
    sgn[P_ (* a partition *)] :=
    Signature[
      PermutationList[
       Cycles[Flatten[
         SplitBy[Range[Total[P]], (Function[{x}, x > #1] &) /@
           Accumulate[P]], Length[P] - 1]]]]
    conjugate[P_List(* a partition *)] :=
    Module[{s = Select[P, #1 > 0 &], i, row, r}, row = Length[s];
      Table[r = row; While[s[[row]] <= i, row--]; r, {i, First[s]}]]
    Total[Function[{x}, sgn[x] sgn[conjugate[x]]] /@
        IntegerPartitions[#]] & /@ Range[20]
    (* George Beck, Oct 25 2014 *)
    a[ n_] := If[ n < 0, 0, SeriesCoefficient[ Sum[ x^k^2 / Product[ 1 + x^j, {j, k}]^2, {k, 0, Sqrt@n}], {x, 0, n}]]; (* Michael Somos, Jun 30 2015 *)
    rnk[prts_]:=Max[prts]-Length[prts]; mtf[n_]:=Module[{pn=IntegerPartitions[n]},Total[If[ EvenQ[ rnk[#]],1,-1]&/@pn]]; Join[{1},Array[mtf,60]] (* Harvey P. Dale, Sep 13 2024 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( sum(k=1, sqrtint(n), x^k^2 / prod(i=1, k, 1 + x^i, 1 + x * O(x^(n - k^2)))^2, 1), n))}; /* Michael Somos, Sep 02 2007 */
    
  • PARI
    my(N=60, x='x+O('x^N)); Vec(1+1/prod(k=1, N, 1-x^k)*sum(k=1, N, (-1)^(k-1)*x^(k*(3*k-1)/2)*(1-x^k)^2/(1+x^k))) \\ Seiichi Manyama, May 23 2023

Formula

G.f.: 1 + Sum_{n>=1} (q^(n^2) / Product_{i=1..n} (1 + q^i)^2).
G.f.: (1 + 4 * Sum_{n>=1} (-1)^n * q^(n*(3*n+1)/2) / (1 + q^n)) / Product_{i>=1} (1 - q^i).
a(n) ~ -(-1)^n * exp(Pi*sqrt(n/6)) / (2*sqrt(n)) [Ramanujan]. - Vaclav Kotesovec, Jun 10 2019
G.f.: 1 - Sum_{n >= 1} (-1)^n*x^n/Product_{k = 1..n} 1 + x^k. See Fine, equation 26.22, p. 55. - Peter Bala, Feb 04 2021
From Seiichi Manyama, May 23 2023: (Start)
a(n) = A340601(n) - A340692(n).
G.f.: 1 + (1/Product_{k>=1} (1-x^k)) * Sum_{k>=1} (-1)^(k-1) * x^(k*(3*k-1)/2) * (1-x^k)^2 / (1+x^k). (End)

Extensions

Entry improved by comments from Dean Hickerson

A000039 Coefficient of q^(2n) in the series expansion of Ramanujan's mock theta function f(q).

Original entry on oeis.org

1, -2, -3, -5, -6, -10, -11, -17, -21, -27, -33, -46, -53, -68, -82, -104, -123, -154, -179, -221, -262, -314, -369, -446, -515, -614, -715, -845, -977, -1148, -1321, -1544, -1778, -2060, -2361, -2736, -3121, -3592, -4097, -4696, -5340, -6105, -6916, -7882, -8919, -10123, -11429, -12952, -14580
Offset: 0

Views

Author

Keywords

References

  • 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).

Crossrefs

A000025(2n)=a(n). Cf. A000199.

Programs

  • Mathematica
    f[q_, s_] := Sum[q^(n^2)/Product[1+q^k, {k, n}]^2, {n, 0, s}]; Take[CoefficientList[Series[f[q, 100], {q, 0, 100}], q], {1, -1, 2}]
  • PARI
    a(n)=if(n<0,0,polcoeff(1+sum(k=1,sqrtint(2*n),x^k^2/prod(i=1,k,1+x^i,1+O(x^(2*n)))^2),2*n))

Formula

a(n) ~ -exp(Pi*sqrt(n/3)) / (2*sqrt(2*n)). - Vaclav Kotesovec, Jun 12 2019

Extensions

More terms from Eric W. Weisstein

A294407 Expansion of 1/(1 + Sum_{i>=1} q^(i^2)/Product_{j=1..i} (1 + q^j)^2).

Original entry on oeis.org

1, -1, 3, -8, 20, -51, 132, -339, 868, -2228, 5720, -14676, 37659, -96644, 248004, -636413, 1633144, -4190920, 10754580, -27598012, 70821032, -181738372, 466370429, -1196782952, 3071141180, -7881051500, 20224069573, -51898276576, 133179482008, -341760374284, 877013123076, -2250559385788
Offset: 0

Views

Author

Ilya Gutkovskiy, Oct 30 2017

Keywords

Comments

Convolution inverse of the 3rd order mock theta function f(q) (A000025).

Crossrefs

Programs

  • Maple
    N:= 50: # to get a(0)..a(N)
    g:= 1/(1+add(q^(i^2)/mul(1+q^j,j=1..i)^2, i=1..floor(sqrt(N)))):
    S:= series(g, q, N+1):
    seq(coeff(S,q,n),n=0..N); # Robert Israel, Nov 06 2017
  • Mathematica
    nmax = 31; CoefficientList[Series[1/(1 + Sum[q^(i^2)/Product[(1 + q^j)^2, {j, 1, i}], {i, 1, nmax}]), {q, 0, nmax}], q]

Formula

G.f.: 1/(1 + Sum_{i>=1} q^(i^2)/Product_{j=1..i} (1 + q^j)^2).

A064053 Auxiliary sequence gamma(n) used to compute coefficients in series expansion of the mock theta function f(q) via A(n) = Sum_{r=0..n} p(r)*gamma(n-r), with p(r) the partition function A000041.

Original entry on oeis.org

1, 0, -4, 4, -4, 4, -4, 8, -4, 0, -4, 8, -4, 0, -4, 4, -4, 0, 0, 8, -4, -4, -4, 8, 0, 0, 0, 4, -4, 0, -4, 8, -4, -4, 0, 8, 0, 0, -8, 4, -8, 0, 4, 8, -4, 0, -8, 8, 0, 0, -4, 4, -4, 0, -4, 12, -4, 0, 0, 8, -4, 0, -8, 0, -4, 4, 4, 8, -4, 0, -12, 8, 0, 0, 0, 4, -4, -4, -4, 8, -8, 0, 0, 8, 4, 4, -8, 0, -4, 0, 0, 4, -4, 0, -8, 12, 0, 0, 4, 0, -4, 0, -4
Offset: 0

Views

Author

Eric W. Weisstein, Aug 28 2001

Keywords

Comments

See Dragonette for the definition of f(q) and A(n). - N. J. A. Sloane, Sep 24 2022

Examples

			G.f. = 1 - 4*x^2 + 4*x^3 - 4*x^4 + 4*x^5 - 4*x^6 + 8*x^7 - 4*x^8 - 4*x^10 + 8*x^11 - 4*x^12 - ...
		

References

  • G. E. Andrews, The theory of partitions, Cambridge University Press, Cambridge, 1998, page 82, Example 5. MR1634067 (99c:11126). [The Gamma function used by Andrews is the classical Gamma function, which is different from the gamma(n) of this sequence. - N. J. A. Sloane, Sep 24 2022]

Crossrefs

Programs

  • Mathematica
    a[ n_]:= SeriesCoefficient[1 +4 *Sum[(-1)^k*x^(k*(3*k+1)/2)/(1+x^k), {k, Quotient[Sqrt[1 +24*n] - 1, 6]}], {x, 0, n}]; (* Michael Somos, Apr 08 2015 *)
  • PARI
    {a(n) = if( n<1, n==0, 4 * polcoeff( sum(k=1, (sqrtint(24*n + 1) - 1) \ 6, (-1)^k * x^((3*k^2 + k)/2) / (1 + x^k), x * O(x^n)), n))}; /* Michael Somos, Mar 13 2006 */

Formula

G.f.: 1 + 4 * Sum_{k>0} (-1)^k * x^(k*(3*k + 1)/2) / (1 + x^k). - Michael Somos, Jun 19 2003
Convolution of this sequence and A000041 is A000025. - Michael Somos, Jun 19 2003
a(n) = 4 * A096661(n) unless n=0.

Extensions

Entry revised by Michael Somos, Mar 13 2006
Deleted edit that tried to change gamma(n) to Gamma(n), and restored original definition. - N. J. A. Sloane, Sep 24 2022
Showing 1-4 of 4 results.