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.

Previous Showing 41-50 of 1364 results. Next

A092848 Expansion of reciprocal of Hauptmodul for Gamma_0(18).

Original entry on oeis.org

1, -1, 0, 2, -2, -1, 4, -4, -1, 8, -8, -2, 14, -14, -4, 24, -23, -6, 40, -38, -10, 63, -60, -16, 98, -92, -24, 150, -140, -36, 224, -208, -54, 329, -304, -78, 478, -440, -112, 684, -627, -160, 968, -884, -224, 1358, -1236, -312, 1884, -1710, -432, 2592, -2346, -590, 3540, -3196, -801, 4796, -4320, -1082, 6454
Offset: 0

Views

Author

Michael Somos, Mar 07 2004

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).

Examples

			G.f. = 1 - x + 2*x^3 - 2*x^4 - x^5 + 4*x^6 - 4*x^7 - x^8 + 8*x^9 + ...
G.f. = q - q^4 + 2*q^10 - 2*q^13 - q^16 + 4*q^19 - 4*q^22 - q^25 + 8*q^28 + ...
		

References

  • B. C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, see p. 345 Entry 1(i).

Crossrefs

Programs

  • Mathematica
    a[ n_] := SeriesCoefficient[ Product[ 1 - x^k, {k, 1, n, 2}] / Product[ 1 - x^k, {k, 3, n, 6}]^3, {x, 0, n}]; (* Michael Somos, Dec 07 2013 *)
    a[ n_] := SeriesCoefficient[  QPochhammer[ x, x^2] / QPochhammer[ x^3, x^6]^3, {x, 0, n}]; (* Michael Somos, Dec 07 2013 *)
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A) * eta(x^6 + A)^3 / (eta(x^2 + A) * eta(x^3 + A)^3), n))}; /* Michael Somos, Dec 07 2013 */
    
  • PARI
    {a(n) = my(A, m); if( n<0, 0, A = 1 + O(x); m=1; while( m<=n, m*=2; A = subst(A, x, x^2); A = sqrt(A + (x*A^2)^2) - x*A^2); polcoeff(A, n))};
    
  • PARI
    {a(n) = if( n<0, 0, polcoeff( prod(k=0, (n-1)\2, (1 - x^(2*k + 1))^if(k%3==1, -2, 1), 1 + x * O(x^n)), n))};

Formula

Expansion of chi(-q) / chi(-q^3)^3 where chi() is a Ramanujan theta function.
Expansion of q^(-1/3) * c(q^2) / c(q) where c() is a cubic AGM theta function. - Michael Somos, Oct 04 2006
Expansion of q^(-1/3) * eta(q) * eta(q^6)^3 / (eta(q^2) * eta(q^3)^3) in powers of q.
Euler transform of period 6 sequence [-1, 0, 2, 0, -1, 0, ...].
Given g.f. A(x), then B(q) = q * A(q^3) satisfies 0 = f(B(q), B(q^2)) where f(u, v) = u^2 - v + 2*u*v^2.
Given g.f. A(x), then B(q) = q * A(q^3) satisfies 0 = f(B(q), B(q^3)) where f(u, v) = (v^3 - v^2 + v) - u^3 * (1 + 2*v + 4*v^2).
G.f. is a period 1 Fourier series which satisfies f(-1 / (18 t)) = (1/2) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A141094. - Michael Somos, Dec 07 2013
G.f.: Product_{k>0} (1 - x^(2*k - 1)) / (1 - x^(6*k - 3))^3.
G.f.: 1 / (1 + (x + x^2) / (1 + (x^2 + x^4) / (1 + (x^3 + x^6) / ...))).
a(n) = A062242(2*n + 1) = (-1)^n * A128111(n). Convolution inverse of A062242.
a(2*n + 1) = - A216046(n). Convolution square is A216046. - Michael Somos, Dec 07 2013
G.f.: T(0), where T(k) = 1 - (x^(k+1)+x^(2*k+2))/((x^(k+1)+x^(2*k+2))+1/T(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Oct 14 2013

A035170 Coefficients in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m = -20.

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 2, 1, 3, 1, 0, 2, 0, 2, 2, 1, 0, 3, 0, 1, 4, 0, 2, 2, 1, 0, 4, 2, 2, 2, 0, 1, 0, 0, 2, 3, 0, 0, 0, 1, 2, 4, 2, 0, 3, 2, 2, 2, 3, 1, 0, 0, 0, 4, 0, 2, 0, 2, 0, 2, 2, 0, 6, 1, 0, 0, 2, 0, 4, 2, 0, 3, 0, 0, 2, 0, 0, 0, 0, 1, 5, 2, 2, 4, 0, 2, 4, 0, 2, 3, 0, 2, 0, 2, 0, 2, 0, 3, 0, 1, 2, 0, 2, 0, 4
Offset: 1

Views

Author

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Coefficients of Dedekind zeta function for the quadratic number field of discriminant -20. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

Examples

			q + q^2 + 2*q^3 + q^4 + q^5 + 2*q^6 + 2*q^7 + q^8 + 3*q^9 + q^10 + ...
		

References

  • B. C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, see p. 253.

Crossrefs

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.

Programs

  • Mathematica
    QP = QPochhammer; s = (1/q) * (QP[q^2]*QP[q^4]*QP[q^5]*(QP[q^10] / (QP[q]* QP[q^20]))-1) + O[q]^105; CoefficientList[s, q] (* Jean-François Alcover, Dec 04 2015 *)
    a[n_] := If[n < 0, 0, DivisorSum[ n, KroneckerSymbol[-20, #] &]]; Table[a[n], {n, 1, 100}] (* G. C. Greubel, Dec 12 2017 *)
  • PARI
    direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))
    
  • PARI
    {a(n) = if( n<1, 0, sumdiv(n, d, kronecker( -20, d)))} \\ Michael Somos, Sep 10 2005
    
  • PARI
    {a(n) = if( n<1, 0, direuler( p=2, n, 1 / (1 - X) / (1 - kronecker( -20, p) * X) )[n])} \\ Michael Somos, Sep 10 2005
    
  • PARI
    {a(n) = if( n<1, 0, qfrep([1, 0; 0, 5], n)[n] + qfrep([2, 1; 1, 3], n)[n])} \\ Michael Somos, Oct 21 2006

Formula

Multiplicative with a(2^e) = a(5^e) = 1, a(p^e) = e+1 if p == 1, 3, 7, 9 (mod 20), a(p^e) = (1+(-1)^e)/2 if p == 11, 13, 17, 19 (mod 20). - Michael Somos, Sep 10 2005
G.f.: Sum_{k>0} x^k * (1 + x^(2*k)) * (1 + x^(6*k)) / (1 + x^(10*k)). - Michael Somos, Sep 10 2005
a(2*n) = a(5*n) = a(n), a(20*n + 11) = a(20*n + 13) = a(20*n + 17) = a(20*n + 19) = 0.
Moebius transform is period 20 sequence [ 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, -1, 0, -1, 0, 0, 0, -1, 0, -1, 0, ...]. - Michael Somos, Oct 21 2006
Expansion of -1 + (phi(q) * phi(q^5) + phi(q^2) * phi(q^10) + 4 * q^3 * psi(q^4)* psi(q^20)) / 2 in powers of q where phi(), psi() are Ramanujan theta functions.
2*a(n) = A028586(n) + A033718(n) if n>0. - Michael Somos, Oct 21 2006
a(n) = A124233(n) unless n=0. a(n) = |A111949(n)|. a(2*n + 1) = A129390(n). a(4*n + 3) = 2 * A033764(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/sqrt(5) = 1.404962... . - Amiram Eldar, Oct 11 2022

A112604 Number of representations of n as a sum of three times a square and two times a triangular number.

Original entry on oeis.org

1, 0, 1, 2, 0, 2, 1, 0, 0, 2, 0, 0, 3, 0, 2, 2, 0, 0, 2, 0, 1, 0, 0, 2, 2, 0, 0, 2, 0, 2, 1, 0, 2, 4, 0, 0, 0, 0, 0, 2, 0, 0, 3, 0, 0, 2, 0, 2, 2, 0, 2, 0, 0, 0, 4, 0, 1, 2, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 4, 2, 0, 0, 1, 0, 0, 4, 0, 2, 2, 0, 0, 2, 0, 2, 2, 0, 0, 2, 0, 0, 3, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 0, 2, 0, 2
Offset: 0

Views

Author

James Sellers, Dec 21 2005

Keywords

Comments

Ramanujan theta functions: f(q) := Prod_{k>=1} (1-(-q)^k) (see A121373), phi(q) := theta_3(q) := Sum_{k=-oo..oo} q^(k^2) (A000122), psi(q) := Sum_{k=0..oo} q^(k*(k+1)/2) (A010054), chi(q) := Prod_{k>=0} (1+q^(2k+1)) (A000700).
Number of representations of 2n as a sum of three times a triangular number and a triangular number.

Examples

			a(12) = 3 since we can write 12 = 3(2)^2 + 0 = 3(-2)^2 + 0 = 0 + 2*6.
2*12 = 24 = 3*1+21 = 3*3+15 = 3*6+6 so a(12) = 3.
G.f. = 1 + x^2 + 2*x^3 + 2*x^5 + x^6 + 2*x^9 + 3*x^12 + 2*x^14 + 2*x^15 + ... - _Michael Somos_, Aug 11 2009
G.f. = q + q^9 + 2*q^13 + 2*q^21 + q^25 + 2*q^37 + 3*q^49 + 2*q^57 + 2*q^61 + ... - _Michael Somos_, Aug 11 2009
		

Crossrefs

A112606(n) = a(2*n). 2 * A112607(n) = a(2*n + 1). A123884(n) = a(3*n). A112605(n) = a(3*n + 2). A131961(n) = a(6*n). A112608(n) =a(6*n + 2). 2 * A131963(n) = a(6*n + 3). 2 * A112609(n) = a(6*n + 5). - Michael Somos, Aug 11 2009

Programs

  • Mathematica
    a[n_] := DivisorSum[4n+1, Switch[Mod[#, 3], 1, 1, 2, -1, 0, 0]&]; Table[ a[n], {n, 0, 104}] (* Jean-François Alcover, Dec 04 2015, adapted from PARI *)
  • PARI
    {a(n) = if(n<0, 0, n=4*n+1; sumdiv(n, d, (d%3==1) - (d%3==2)))};
    
  • PARI
    {a(n) = my(A); if(n<0, 0, A=x*O(x^n); polcoeff( eta(x^6+A)^5 / eta(x^2+A)*(eta(x^4+A) / eta(x^3+A) / eta(x^12+A))^2, n))}; /* Michael Somos, Feb 14 2006 */

Formula

a(n) = A002324(4n+1) = A033762(2n) = d_{1, 3}(4n+1) - d_{2, 3}(4n+1) where d_{a, m}(n) equals the number of divisors of n which are congruent to a mod m.
From Michael Somos, Feb 14 2006: (Start)
Expansion of (psi(q)psi(q^3) + psi(-q)psi(-q^3))/2 in powers of q^2 where psi() is a Ramanujan theta function.
G.f.: (Sum_{k} x^k^2)^3*(Sum_{k>0} x^((k^2-k)/2))^2 = Product_{k>0} (1-x^(4k))(1-x^(6k))(1+x^(2k))(1+x^(3k))^2/(1+x^(6k))^2.
Euler transform of period 12 sequence [0, 1, 2, -1, 0, -2, 0, -1, 2, 1, 0, -2, ...]. (End)
From Michael Somos, Aug 11 2009: (Start)
G.f. is a period 1 Fourier series which satisfies f(-1 / (48 t)) = 3^(1/2) (t/i) g(t) where q = exp(2 Pi i t) and g() is g.f. for A164272.
a(3*n + 1) = 0. (End)
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/(2*sqrt(3)) = 0.906899... (A093766). - Amiram Eldar, Nov 24 2023

A001936 Expansion of q^(-1/4) * (eta(q^4) / eta(q))^2 in powers of q.

Original entry on oeis.org

1, 2, 5, 10, 18, 32, 55, 90, 144, 226, 346, 522, 777, 1138, 1648, 2362, 3348, 4704, 6554, 9056, 12425, 16932, 22922, 30848, 41282, 54946, 72768, 95914, 125842, 164402, 213901, 277204, 357904, 460448, 590330, 754368, 960948, 1220370, 1545306
Offset: 0

Views

Author

Keywords

Comments

The Cayley reference is actually to A079006. - Michael Somos, Feb 24 2011
In the math overflow link is a conjecture that a(n) == a(9*n + 2) (mod 4).
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number of 4-regular bipartitions of n. - N. J. A. Sloane, Oct 20 2019
The g.f. in the form A(x) = Sum_{k >= 0} x^(k*(k+1)) / (1 + 2*Sum_{k >= 1} (-1)^k * x^(k^2)) == Sum_{k >= 0} x^(k*(k+1)) (mod 2). It follows that a(n) is odd iff n = k*(k + 1) for some nonnegative integer k. - Peter Bala, Jan 04 2025

Examples

			G.f. = 1 + 2*x + 5*x^2 + 10*x^3 + 18*x^4 + 32*x^5 + 55*x^6 + 90*x^7 + 144*x^8 + ...
G.f. = q + 2*q^5 + 5*q^9 + 10*q^13 + 18*q^17 + 32*q^21 + 55*q^25 + 90*q^29 + ...
		

References

  • 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. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; Eq. (34.3).
  • 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

Number of r-regular bipartitions of n for r = 2,3,4,5,6: A022567, A328547, A001936, A263002, A328548, A333374.

Programs

  • Maple
    with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d,j; if n=0 then 1 else add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: a:= etr(n-> [2,2,2,0] [modp(n-1,4)+1]): seq(a(n), n=0..40); # Alois P. Heinz, Sep 08 2008
    f:=(k,M) -> mul(1-q^(k*j),j=1..M); LRBP := (L,M) -> (f(L,M)/f(1,M))^2; S := L -> seriestolist(series(LRBP(L,80),q,60)); S(4); # N. J. A. Sloane, Oct 20 2019
  • Mathematica
    m = 38; CoefficientList[ Series[ Product[ (1 - x^(4*k))/(1 - x^k), {k, 1, m}]^2 , {x, 0, m}], x] (* Jean-François Alcover, Sep 02 2011, after g.f. *)
    a[ n_] := SeriesCoefficient[ (EllipticTheta[ 2, 0, x] / EllipticTheta[ 4, 0, x]) / (2 x^(1/4)), {x, 0, n}]; (* Michael Somos, May 16 2015 *)
    a[ n_] := SeriesCoefficient[ (Product[ 1 - x^k, {k, 4, n, 4}] / Product[ 1 - x^k, {k, n}])^2, {x, 0, n}]; (* Michael Somos, May 16 2015 *)
    a[ n_] := SeriesCoefficient[ (QPochhammer[ x^4] / QPochhammer[ x])^2, {x, 0, n}]; (* Michael Somos, May 16 2015 *)
    a[ n_] := SeriesCoefficient[ (QPochhammer[ -x, x] QPochhammer[ -x^2, x^2])^2, {x, 0, n}]; (* Michael Somos, May 16 2015 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( (eta(x^4 + x * O(x^n)) / eta(x + x * O(x^n)))^2, n))};
    
  • PARI
    {a(n) = if( n<0, 0, polcoeff( prod(k=1, n, 1 / if(k%4, 1 - x^k, 1), 1 + x * O(x^n))^2, n))};

Formula

G.f.: Product ( 1 - x^k )^(-c(k)); c(k) = 2, 2, 2, 0, 2, 2, 2, 0, ....
Convolution square of A001935. A079006(n) = (-1)^n a(n).
Expansion of q^(-1/4) * (1/2) * (k / k')^(1/2) in powers of q.
Euler transform of period 4 sequence [ 2, 2, 2, 0, ...].
Given g.f. A(x), then B(q) = (q * A(q^4))^4 satisfies 0 = f(B(q), B(q^2)) where f(u, v) = (1 + 16*u) * (1 + 16*v) * v - u^2. - Michael Somos, Jul 09 2005
Given g.f. A(x), then B(q) = q * A(q^4) satisfies 0 = f(B(q), B(q^3)) where f(u, v) = (u^2 + v^2)^2 - u*v * (1 + 4*u*v)^2. - Michael Somos, Jul 09 2005
G.f.: (Product_{k>0} (1 + x^(2*k)) / (1 - x^(2*k - 1)))^2 = (Product_{k>0} (1 - x^(4*k)) / (1 - x^k))^2.
Equals A000009 convolved with A098613. - Gary W. Adamson, Mar 24 2011
a(9*n + 2) = a(n) + 4 * A210656(3*n). - Michael Somos, Apr 02 2012
Convolution inverse is A082304. - Michael Somos, May 16 2015
G.f. is a period 1 Fourier series which satisfies f(-1 / (64 t)) = (1/4) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A082304. - Michael Somos, May 16 2015
Expansion of f(-x^4)^2 / f(-x)^2 = psi(x^2) / phi(-x) = psi(-x)^2 / phi(-x)^2 = psi(x)^2 / phi(-x^2)^2 = psi(x^2)^2 / psi(-x)^2 = chi(x)^2 / chi(-x^2)^4 = 1 / (chi(x)^2 * chi(-x)^4) = 1 / (chi(-x)^2 * chi(-x^2)^2) in powers of q where phi(), psi(), chi(), f() are Ramanujan theta functions. - Michael Somos, May 16 2015
a(n) ~ exp(Pi*sqrt(n)) / (8*sqrt(2)*n^(3/4)). - Vaclav Kotesovec, Aug 18 2015
G.f.: A(x) = Sum_{n >= 0} x^(n*(n+1)) / Sum_{n = -oo..oo} (-1)^n*x^(n^2). - Peter Bala, Feb 19 2021

A002175 Excess of number of divisors of 12n+1 of form 4k+1 over those of form 4k+3.

Original entry on oeis.org

1, 2, 3, 2, 1, 2, 2, 4, 2, 2, 1, 0, 4, 2, 3, 2, 2, 4, 0, 2, 2, 0, 4, 2, 3, 0, 2, 6, 2, 2, 1, 2, 0, 2, 2, 2, 2, 4, 2, 0, 4, 4, 4, 0, 1, 2, 0, 4, 2, 0, 2, 2, 5, 2, 0, 2, 2, 4, 4, 2, 0, 2, 4, 2, 2, 0, 4, 0, 0, 2, 3, 2, 4, 2, 0, 4, 0, 6, 2, 4, 1, 0, 4, 2, 2, 2, 2, 0, 0, 2, 0, 2, 8, 2, 2, 0, 2, 4, 0, 4, 2, 2, 3, 2, 2
Offset: 0

Views

Author

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number of ways to write n as an ordered sum of 2 generalized pentagonal numbers. - Ilya Gutkovskiy, Aug 14 2017

Examples

			G.f. = 1 + 2*x + 3*x^2 + 2*x^3 + x^4 + 2*x^5 + 2*x^6 + 4*x^7 + 2*x^8 + 2*x^9 + ...
G.f. = q + 2*q^13 + 3*q^25 + 2*q^37 + q^49 + 2*q^61 + 2*q^73 + 4*q^85 + 2*q^97 + ...
		

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

Programs

  • Maple
    series(mul( ( (1 + q^n)*(1 - q^(3*n))/(1 + q^(3*n)) )^2, n = 1..100), q, 101):
    seq(coeftayl(%, q = 0, n), n = 0..100); # Peter Bala, Jan 05 2025
  • Mathematica
    ed[n_]:=Module[{divs=Divisors[12n+1]},Count[divs,?(Mod[#,4] == 1&)]- Count[divs,?(Mod[#,4]==3&)]]; Array[ed,110,0] (* Harvey P. Dale, Jul 01 2012 *)
    a[ n_] := If[ n < 0, 0, With[ {m = 12 n + 1}, Sum[ KroneckerSymbol[ 4, d], {d, Divisors[m]}]]]; (* Michael Somos, Apr 23 2014 *)
    a[ n_] := SeriesCoefficient[ (QPochhammer[ x^2] QPochhammer[ x^3]^2 / (QPochhammer[ x] QPochhammer[ x^6]))^2, {x, 0, n}]; (* Michael Somos, Apr 23 2014 *)
    a[ n_] := SeriesCoefficient[ (EllipticTheta[ 4, 0, x^3] / QPochhammer[ x, x^2])^2, {x, 0, n}]; (* Michael Somos, May 25 2015 *)
  • PARI
    {a(n) = if( n<0, 0, n = 12*n + 1; sumdiv( n, d, (d%4==1) - (d%4==3)))}; /* Michael Somos, Sep 19 2005 */
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x^2 + A) * eta(x^3 + A)^2 / (eta(x + A) * eta(x^6 + A)))^2, n))}; /* Michael Somos, Jun 02 2012 */

Formula

Expansion of (phi(-x^3) / chi(-x))^2 in powers of x where phi(), chi() are Ramanujan theta functions.
Expansion of q^(-1/12) * (eta(q^2) * eta(q^3)^2 / (eta(q) * eta(q^6)))^2 in powers of q. - Michael Somos, Sep 19 2005
Euler transform of period 6 sequence [ 2, 0, -2, 0, 2, -2, ...]. - Michael Somos, Sep 19 2005
G.f. is a period 1 Fourier series which satisfies f(-1 / (72 t)) = 2 (t/i) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A258279. - Michael Somos, May 25 2015
From Michael Somos, Jun 02 2012: (Start)
a(n) = A008441(3*n) = A121363(3*n) = A122865(4*n) = A122856(8*n).
a(n) = A116604(6*n) = A125079(6*n) = A129447(6*n) = A138741(6*n).
From Michael Somos, May 25 2015: (Start)
a(n) = A258277(4*n) = A258278(8*n) = A258291(3*n).
a(n) = - A258210(12*n + 1) = A258228(12*n + 1) = A258256(12*n + 1).
2*a(n) = A258279(12*n + 1) = - A258292(12*n + 1). (End)
G.f.: (Sum_{k = -oo..oo} x^(k*(3*k-1)/2))^2. - Ilya Gutkovskiy, Aug 14 2017
G.f.: ( Product_{n >= 1} (1 + q^n)*(1 - q^(3*n))/(1 + q^(3*n)) )^2. - Peter Bala, Jan 05 2025

A122129 Expansion of 1 + Sum_{k>0} x^k^2/((1-x)(1-x^2)...(1-x^(2k))).

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 5, 7, 9, 12, 15, 19, 24, 30, 37, 46, 57, 69, 84, 102, 123, 148, 177, 211, 252, 299, 353, 417, 491, 576, 675, 789, 920, 1071, 1244, 1442, 1670, 1929, 2224, 2562, 2946, 3381, 3876, 4437, 5072, 5791, 6602, 7517, 8551, 9714, 11021, 12493, 14145
Offset: 0

Views

Author

Michael Somos, Aug 21 2006

Keywords

Comments

Generating function arises naturally in Rodney Baxter's solution of the Hard Hexagon Model according to George Andrews.
a(n) = number of SE partitions of n, for n >= 1; see A237981. - Clark Kimberling, Mar 19 2014
In Watson 1937 page 275 he writes "Psi_0(1,q) = prod_1^oo (1+q^{2n}) G(q^8)" so this is the expansion in powers of q^2. - Michael Somos, Jun 28 2015
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Rogers-Ramanujan functions: G(x) (see A003114), H(x) (A003106).
From Gus Wiseman, Feb 19 2022: (Start)
This appears to be the number of integer partitions of n with every other pair of adjacent parts strictly decreasing, as in the pattern a > b >= c > d >= e for a partition (a, b, c, d, e). For example, the a(1) = 1 through a(9) = 12 partitions are:
(1) (2) (3) (4) (5) (6) (7) (8) (9)
(21) (31) (32) (42) (43) (53) (54)
(211) (41) (51) (52) (62) (63)
(311) (321) (61) (71) (72)
(411) (322) (422) (81)
(421) (431) (432)
(511) (521) (522)
(611) (531)
(3221) (621)
(711)
(4221)
(32211)
The even-length case is A351008. The odd-length case appears to be A122130. Swapping strictly and weakly decreasing relations appears to give A122135. The alternately unequal and equal case is A351006, strict A035457, opposite A351005, even-length A351007. (End)
Wiseman's first conjecture above was proved by Gordon, Theorem 7. For two other combinatorial interpretations of this sequence see Connor, Proposition 1. - Peter Bala, Dec 22 2024

Examples

			Clark Kimberling's SE partition comment, n=6: the 5 SE partitions are [1,1,1,1,1,1] from the partitions 6 and 1^6; [1,1,1,2,1] from 5,1 and 2,1^4; [1,1,3,1] from 4,2 and 2^2,1^2; [2,3,1] from 3,2,1 and 3^2 and 2^3; and [1,2,2,1] from 4,1^2 and 3,1^3. - _Wolfdieter Lang_, Mar 20 2014
G.f. = 1 + x + x^2 + 2*x^3 + 3*x^4 + 4*x^5 + 5*x^6 + 7*x^7 + 9*x^8 + ...
G.f. = 1/q + q^39 + q^79 + 2*q^119 + 3*q^159 + 4*q^199 + 5*q^239 + ...
		

References

  • G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 8, Eq. (1.7). MR0858826 (88b:11063)
  • G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(a), p. 591.

Crossrefs

Programs

  • Maple
    f:=n->1/mul(1-q^(20*k+n),k=0..20);
    f(1)*f(3)*f(4)*f(5)*f(7)*f(9)*f(11)*f(13)*f(15)*f(16)*f(17)*f(19);
    series(%,q,200); seriestolist(%); # N. J. A. Sloane, Mar 19 2012.
    # second Maple program:
    with(numtheory):
    a:= proc(n) option remember; `if`(n=0, 1, add(add(d*[0, 1, 0,
           1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1]
          [1+irem(d, 20)], d=divisors(j)) *a(n-j), j=1..n)/n)
        end:
    seq(a(n), n=0..60);  # Alois P. Heinz, Jul 12 2013
  • Mathematica
    a[0] = 1; a[n_] := a[n] = Sum[Sum[d*{0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1}[[1+Mod[d, 20]]], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n; Table[a[n], {n, 0, 60}] (* Jean-François Alcover, Jan 10 2014, after Alois P. Heinz *)
    a[ n_] := If[ n < 0, 0, SeriesCoefficient[ Sum[ x^k^2 / QPochhammer[ x, x, 2 k], {k, 0, Sqrt @ n}], {x, 0, n}]]; (* Michael Somos, Jun 28 2015 *)
    a[ n_] := SeriesCoefficient[ 1 / (QPochhammer[ x, x^2] QPochhammer[ x^4, x^20] QPochhammer[ x^16, x^20]), {x, 0, n}]; (* Michael Somos, Jun 28 2015 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( sum(k=0, sqrtint(n), x^k^2 / prod(i=1, 2*k, 1 - x^i, 1 + x * O(x^(n-k^2)))), n))};

Formula

Euler transform of period 20 sequence [ 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, ...].
Expansion of f(-x^2) * f(-x^20) / (f(-x) * f(-x^4,-x^16)) in powers of x where f(,) is the Ramanujan general theta function.
Expansion of f(x^3, x^7) / f(-x, -x^4) in powers of x where f(,) is the Ramanujan general theta function. - Michael Somos, Jun 28 2015
Expansion of f(-x^8, -x^12) / psi(-x) in powers of x where psi() is a Ramanujan theta function. - Michael Somos, Jun 28 2015
Expansion of G(x^4) / chi(-x) in powers of x where chi() is a Ramanujan theta function and G() is a Rogers-Ramanujan function. - Michael Somos, Jun 28 2015
G.f.: Sum_{k>=0} x^k^2 / ((1 - x) * (1 - x^2) ... (1 - x^(2*k))).
G.f.: 1 / (Product_{k>0} (1 - x^(2*k-1)) * (1 - x^(20*k-4)) * (1 - x^(20*k-16))).
Let f(n) = 1/Product_{k >= 0} (1 - q^(20k+n)). Then g.f. is f(1)*f(3)*f(4)*f(5)*f(7)*f(9)*f(11)*f(13)*f(15)*f(16)*f(17)*f(19). - N. J. A. Sloane, Mar 19 2012
a(n) is the number of partitions of n into parts that are either odd or == +-4 (mod 20). - Michael Somos, Jun 28 2015
a(n) ~ (3+sqrt(5))^(1/4) * exp(Pi*sqrt(2*n/5)) / (4*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Aug 30 2015

A186690 Expansion of - (1/8) theta_3''(0, q) / theta_3(0, q) in powers of q.

Original entry on oeis.org

1, -2, 4, -4, 6, -8, 8, -8, 13, -12, 12, -16, 14, -16, 24, -16, 18, -26, 20, -24, 32, -24, 24, -32, 31, -28, 40, -32, 30, -48, 32, -32, 48, -36, 48, -52, 38, -40, 56, -48, 42, -64, 44, -48, 78, -48, 48, -64, 57, -62, 72, -56, 54, -80, 72, -64, 80, -60, 60, -96, 62, -64
Offset: 1

Views

Author

Michael Somos, Feb 25 2011

Keywords

Comments

If A(x) is the generating function then 1 / Pi = 8 A( exp( -Pi) ). [Plouffe, equation 1.2]
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Examples

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

References

  • A. P. Prudnikov, Yu. A. Brychkov and O.I. Marichev, "Integrals and Series", Volume 1: "Elementary Functions", Chapter 4: "Finite Sums", New York, Gordon and Breach Science Publishers, 1986-1992, Equation (5.1.29.8).

Crossrefs

Programs

  • Mathematica
    a[ n_] := With[ {m = InverseEllipticNomeQ @ q}, SeriesCoefficient[ (1/8) (EllipticE[m] - (1 - m) EllipticK[m]) EllipticK[m]/(Pi/2)^2, {q, 0, n}]];
  • PARI
    {a(n) = if( n<1, 0, -(-1)^n * sumdiv( n, d, d / gcd(d, 2)))};
    
  • Python
    from math import prod
    from sympy import factorint
    def A186690(n): return (1 if n&1 else -1)*prod((p**(e+1)-1)//(p-1) if p&1 else 1<Chai Wah Wu, Jun 23 2024

Formula

Multiplicative with a(2^e) = -(2^e) if e>0, a(p^e) = (p^(e+1) - 1) / (p - 1) if p > 2.
Expansion of (E - (1 - k^2) * K) * K / (2 Pi^2) in powers of the nome q where K, E are complete elliptic integrals.
Expansion of (1/2) x (d phi(x) / dx) / phi(x) in powers of x where phi() is a Ramanujan theta function.
G.f.: Sum_{k>0} - (-1)^k * k * x^k / (1 - x^(2*k)) = Sum_{k>0} x^(2*k-1) / (1 + x^(2*k-1))^2 = (Sum_{k>0} n^2 x^(n^2)) / (Sum_k x^(n^2)).
Dirichlet g.f. zeta(s) *zeta(s-1) *(1-7*2^(-s)+14*4^(-s)-8^(1-s)) / (1-2^(1-s)). - R. J. Mathar, Jun 01 2011
a(n) = -(-1)^n * A002131(n).
MOBIUS transform is A186111. - Michael Somos, Apr 25 2015

A010816 Expansion of Product_{k>=1} (1 - x^k)^3.

Original entry on oeis.org

1, -3, 0, 5, 0, 0, -7, 0, 0, 0, 9, 0, 0, 0, 0, -11, 0, 0, 0, 0, 0, 13, 0, 0, 0, 0, 0, 0, -15, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, -19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -23, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -27, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Also, number of different partitions of n into parts of -3 different kinds (based upon formal analogy). - Michele Dondi (blazar(AT)lcm.mi.infn.it), Jun 29 2004

Examples

			G.f. = 1 - 3*x + 5*x^3 - 7*x^6 + 9*x^10 - 11*x^15 + 13*x^21 - 15*x^28 + ...
G.f. for b(n): = q - 3*q^9 + 5*q^25 - 7*q^49 + 9*q^81 - 11*q^121 + 13*q^169 + ...
		

References

  • T. J. I'a. Bromwich, Introduction to the Theory of Infinite Series, Macmillan, 2nd. ed. 1949, p. 117, Problem 22.
  • I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983, (2.5.14).
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. Fifth ed., Clarendon Press, Oxford, 2003, p. 285, Theorem 357 (Jacobi).
  • D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.4, p. 410, Problem 23.
  • S. Ramanujan, Notebooks, Tata Institute of Fundamental Research, Bombay 1957 Vol. 1, see page 267 MR0099904 (20 #6340)

Crossrefs

Programs

  • Julia
    # DedekindEta is defined in A000594.
    A010816List(len) = DedekindEta(len, 3)
    A010816List(39) |> println # Peter Luschny, Mar 10 2018
    
  • Maple
    S:= series(mul(1-x^k,k=1..200)^3,x,201):
    seq(coeff(S,x,j),j=0..200); # Robert Israel, Feb 01 2018
    A010816 := n -> if issqr(8*n+1) then isqrt(8*n+1); (-1)^iquo(%, 2) * % else 0 fi:
    seq(A010816(n), n=0..98); # Peter Luschny, Apr 17 2022
  • Mathematica
    a[ n_] := SeriesCoefficient[ EllipticThetaPrime[ 1, 0, x^(1/2)] / (2 x^(1/8)), {x, 0, n}]; (* Michael Somos, Oct 22 2011 *)
    a[ n_] := With[ {m = 8 n + 1}, If[m > 0 && OddQ[ Length @ Divisors @ m], Sqrt[m] KroneckerSymbol[-4, Sqrt[m]], 0]];  (* Michael Somos, Aug 26 2015 *)
    CoefficientList[QPochhammer[q]^3 + O[q]^100, q] (* Jean-François Alcover, Nov 25 2015 *)
    a[ n_] := With[ {x = Sqrt[8 n + 1]}, If[ IntegerQ[ x], (-1)^Quotient[ x, 2] x, 0]]; (* Michael Somos, Feb 01 2018 *)
    a[ n_] := If[ n < 1, Boole[ n == 0], Times @@ (If[ # == 2 || OddQ[ #2], 0, (KroneckerSymbol[ -4, #] #)^(#2/2)] & @@@ FactorInteger[ 8 n + 1])]; (* Michael Somos, Feb 01 2018 *)
  • PARI
    {a(n) = my(x); if( n<0, 0, if( issquare( 8*n + 1, &x), (-1)^(x\2) * x))}; /* Michael Somos, Nov 08 2005 */
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A)^3, n))};
    
  • Python
    from sympy import integer_nthroot
    def A010816(n):
        a, b = integer_nthroot((n<<3)+1,2)
        return (-a if a&2 else a) if b else 0 # Chai Wah Wu, Nov 02 2024

Formula

G.f.: Product_{k>=1} (1-x^k)^3 = Sum_{n>=0} (-1)^n*(2*n+1)*x^(n*(n+1)/2) (Jacobi).
Given g.f. A(x), then q * A(q^8) = eta(q^8)^3 = theta_2(q^4)*theta_3*(q^4)*theta_4(q^4) / 2 = theta_1'(q^4) / (2*Pi). - Michael Somos, Nov 08 2005
Given g.f. A(x), then x*A(x)^8 is g.f. for A000594.
a(n) = b(8*n + 1) where b() is multiplicative with b(p^e) = 0 if e odd, b(2^e) = 0^e, b(p^e) = p^(e/2) if p == 1 (mod 4), b(p^e) = (-p)^(e/2) if p == 3 (mod 4). - Michael Somos, Aug 22 2006
Expansion of f(-x)^3 in powers of x where f() is a Ramanujan theta function.
G.f. is a period 1 Fourier series which satisfies f(-1 / (64 t)) = 2^(9/2) (t/i)^(3/2) f(t) where q = exp(2 Pi i t). - Michael Somos, Sep 09 2007
a(3*n + 2) = a(5*n + 2) = a(5*n + 4) = a(9*n + 4) = a(9*n + 7) = 0. a(9*n + 1) = -3 * a(n). a(25*n + 3) = 5 * a(n). - Michael Somos, Sep 09 2007
a(3*n) = A116916(n).
a(n) = (t*(t+1)-2*n-1)*(t-r)*(-1)^(t+1), where t = floor(sqrt(2*(n+1))+1/2) and r = floor(sqrt(2*n)+1/2). - Mikael Aaltonen, Jan 17 2015
a(0) = 1, a(n) = -(3/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 26 2017
G.f.: exp(-3*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
G.f.: Product_{n >= 1} (1 - q^(4*n))^3 * (1 + q^(4*n-1))^(-3) * (1 - q^(4*n-2))^6 * (1 + q^(4*n-3))^(-3). - Peter Bala, Jun 07 2025

A121444 Expansion of f(x^3, x^9) * f(x, x^2) in powers of x where f(, ) is Ramanujan's general theta functions.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 2, 1, 1, 0, 1, 2, 1, 0, 2, 1, 1, 1, 1, 1, 1, 2, 1, 0, 0, 1, 2, 2, 1, 1, 0, 3, 0, 1, 1, 0, 2, 0, 1, 1, 2, 2, 1, 1, 0, 1, 1, 1, 2, 1, 1, 0, 1, 2, 1, 0, 3, 0, 0, 1, 1, 2, 1, 1, 1, 1, 3, 1, 0, 1, 0, 2, 0, 1, 1, 1, 2, 1, 0, 0, 1, 3, 2
Offset: 0

Views

Author

Michael Somos, Jul 30 2006

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Examples

			G.f. = 1 + x + x^2 + x^3 + x^4 + 2*x^5 + x^7 + x^8 + x^9 + 2*x^10 + x^11 + ...
G.f. = q^5 + q^17 + q^29 + q^41 + q^53 + 2*q^65 + q^89 + q^101 + q^113 + ...
		

Crossrefs

Programs

  • Mathematica
    a[ n_] := If[ n < 0, 0, Sum[ I^d, {d, Divisors[12 n + 5]}] / (2 I)]; (* Michael Somos, Jul 25 2015 *)
    a[ n_] := SeriesCoefficient[ 2 x^(3/8) QPochhammer[ x^6]^3 / (QPochhammer[ x, x^2] EllipticTheta[ 2, 0, x^(3/2)]), {x, 0, n}]; (* Michael Somos, Jan 31 2015 *)
    a[ n_] := Length @ FindInstance[ 24 n + 10 == (6 j + 3)^2 + (6 k + 1)^2 && j >= 0, {j, k}, Integers, 10^9]; (* Michael Somos, Jul 02 2015 *)
    a[ n_] := If[ n < 0, 0, DivisorSum[ 12 n + 5, KroneckerSymbol[ -4, #] &] / 2]; (* Michael Somos, Nov 11 2015 *)
    a[ n_] := If[ n < 0, 0, Sum[ Boole[ Mod[d, 4] == 1] - Boole[ Mod[d, 4] == 3], {d, Divisors[12 n + 5]}] / 2]; (* Michael Somos, Nov 11 2015 *)
    a[ n_] := SeriesCoefficient[ QPochhammer[ -x, x] QPochhammer[ x^3] QPochhammer[ x^6], {x, 0, n}]; (* Michael Somos, Nov 11 2015 *)
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^2 + A) * eta(x^3 + A) * eta(x^6 + A) / eta(x + A), n))};
    
  • PARI
    {a(n) = if( n<0, 0, n = 12*n + 5; sumdiv(n, d, (d%4==1) - (d%4==3)) / 2)};

Formula

Expansion of f(-x^3) * f(-x^6) / chi(-x) in powers of x where chi(), f() are Ramanujan theta functions.
Expansion of q^(-5/12) * eta(q^2) * eta(q^3) * eta(q^6) / eta(q) in powers of q.
Euler transform of period 6 sequence [ 1, 0, 0, 0, 1, -2, ...].
G.f. is a period 1 Fourier series which satisfies f(-1 / (72 t)) = (t/i) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A258210.
G.f.: Product_{k>0} (1 + x^k) * (1 - x^(3*k)) * (1 - x^(6*k)).
-2 * a(n) = A121363(3*n + 1).
Convolution square is A098098.
a(n) = (-1)^n * A258832(n) = A052343(3*n + 1). -a(n) = A258291(3*n + 1). 2 * a(n) = A008441(3*n + 1). - Michael Somos, Jul 02 2015
From Peter Bala, Jan 07 2021: (Start)
G.f. A(x) = Sum_{n = -oo..oo} x^n/(1 - x^(12*n + 5)). See Agarwal, p. 285, equation 6.19.
A(x^2) = Sum_{n = -oo..oo} x^(2*n)/(1 - x^(12*n + 5)). Cf. A033761. (End)

A079006 Expansion of q^(-1/4) * (eta(q) * eta(q^4)^2 / eta(q^2)^3)^2 in powers of q.

Original entry on oeis.org

1, -2, 5, -10, 18, -32, 55, -90, 144, -226, 346, -522, 777, -1138, 1648, -2362, 3348, -4704, 6554, -9056, 12425, -16932, 22922, -30848, 41282, -54946, 72768, -95914, 125842, -164402, 213901, -277204, 357904, -460448, 590330, -754368, 960948, -1220370
Offset: 0

Views

Author

Michael Somos, Dec 22 2002

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
The Lagrange series reversion of Sum_{n >= 1} a(n-1)*x^n is Sum_{n >= 1} A002103(n-1)*x^n. See the example in A002103. - Wolfdieter Lang, Jul 09 2016

Examples

			G.f. A(x) = 1 - 2*x + 5*x^2 - 10*x^3 + 18*x^4 - 32*x^5 + 55*x^6 - 90*x^7 + 144*x^8 + ...
G.f. B(q) = q * A(q^4) = q - 2*q^5 + 5*q^9 - 10*q^13 + 18*q^17 - 32*q^21 + 55*q^25 - 90*q^29 + ...
		

References

  • 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. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; Eq. (34.3).

Crossrefs

Programs

  • Mathematica
    a[ n_] := SeriesCoefficient[ Product[(1 + x^(k + 1)) / (1 + x^k), {k, 1, n, 2}]^2, {x, 0, n}]; (* Michael Somos, Jul 08 2011 *)
    a[ n_] := With[ {m = InverseEllipticNomeQ[ q]}, SeriesCoefficient[ (m / 16 / q)^(1/4), {q, 0, n}]]; (* Michael Somos, Jul 08 2011 *)
    QP = QPochhammer; s = (QP[q]*(QP[q^4]^2/QP[q^2]^3))^2 + O[q]^40; CoefficientList[s, q] (* Jean-François Alcover, Nov 23 2015 *)
    nmax = 50; CoefficientList[Series[Product[(1+x^(2*k))^4 / (1+x^k)^2, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jul 04 2016 *)
    a[ n_] := SeriesCoefficient[ QPochhammer[ x^4]^2 / QPochhammer[ -x]^2, {x, 0, n}]; (* Michael Somos, Apr 19 2017 *)
  • PARI
    {a(n) = my(N, A); if( n<0, 0, N = (sqrtint(16*n + 1) + 1)\2; A = contfracpnqn( matrix(2, N, i, j, if( i==1, if( j<2, 1 + O(x^(N^2 + N)), (x^(j-1) + x^(3*j - 3))^2), 1 - x^(4*j - 2)))); polcoeff( A[2,1] / A[1,1], 4*n))}; /* Michael Somos, Sep 01 2005 */
    
  • PARI
    {a(n) = my(A, m); if( n<0, 0, A = 1 + O(x); m = 1; while( m<=n, m*=2; A = subst(A, x, x^2); A = sqrt(A / (1 + 4 * x*A^2))); polcoeff(A, n))};
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x + A) * eta(x^4 + A)^2 / eta(x^2 + A)^3)^2, n))};

Formula

a(n) = (2/n)*Sum_{k=1..n} (-1)^k*A046897(k)*a(n-k). - Vladeta Jovovic, Dec 24 2002
Expansion of q^(-1/4) * (1/2) * k^(1/2) in powers of q, where k^2 is the parameter and q the Jacobi nome of elliptic functions.
Expansion of (1/(2*q)) * (1 - sqrt(k')) / (1 + sqrt(k')) in powers of q^4, where k'^2 is the complementary parameter and q the Jacobi nome of elliptic functions. See the Fricke reference.
Expansion of psi(x^2) / phi(x) = psi(x)^2 / phi(x)^2 = psi(x^2)^2 / psi(x)^2 = psi(-x)^2 / phi(-x^2)^2 = chi(-x)^2 / chi(-x^2)^4 = 1 / (chi(x)^2 * chi(-x^2)^2) = 1 / (chi(x)^4 * chi(-x)^2) = f(-x^4)^2 / f(x)^2 in powers of x where phi(), psi(), chi(), f() are Ramanujan theta functions.
Euler transform of period 4 sequence [-2, 4, -2, 0, ...].
G.f. A(x) satisfies A(x)^2 = A(x^2) / (1 + 4 * x * A(x^2)^2). - Michael Somos, Mar 19 2004
Given g.f. A(x), then B(q) = q * A(q^4) satisfies 0 = f(B(q), B(q^2)) where f(u, v) = u^2 * (1 + 4 * v^2) - v. - Michael Somos, Jul 09 2005
Given g.f. A(x), then B(q) = q * A(q^4) satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u1*u3 * (u6 + u2)^2 - u2*u6. - Michael Somos, Jul 09 2005
G.f.: (Product_{k>0} (1 + x^(2*k)) / (1 + x^(2*k-1)))^2 = (Product_{k>0} (1 - x^(4*k)) / (1 - (-x)^k))^2.
Expansion of continued fraction 1 / (1 - x^2 + (x^1 + x^3)^2 / (1 - x^6 + (x^2 + x^6)^2 / (1 - x^10 + (x^3 + x^9)^2 / ...))) in powers of x^4. - Michael Somos, Sep 01 2005
Given g.f. A(x), then B(q) = 2 * q * A(q^4) satisfies 0 = f(B(q), B(q^3)) where f(u, v) = (1 - u^4) * (1 - v^4) - (1 - u*v)^4 . - Michael Somos, Jan 01 2006
G.f. is a period 1 Fourier series which satisfies f(-1 / (16 t)) = (1/2) g(t) where q = exp(2 Pi i t) and g() is g.f. for A189925.
Convolution inverse of A029839. Convolution square of A083365. a(n) = (-1)^n * A001936(n).
G.f.: 1/Q(0), where Q(k)= 1 - x^(k+1/2) + (x^((k+1)/4) + x^((3*k+3)/4))^2/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 02 2013
a(n) ~ (-1)^n * exp(Pi*sqrt(n)) / (2^(7/2)*n^(3/4)). - Vaclav Kotesovec, Jul 04 2016
Given g.f. A(x), and B(x) is the g.f. for A008441, then A(x) = B(x^2) / B(x) and A(x) * A(x^2) * A(x^4) * ... = 1 / B(x). - Michael Somos, Apr 20 2017
Expansion of continued fraction 1 / (1 - x^1 + x^1*(1 + x^1)^2 / (1 - x^3 + x^2*(1 + x^2)^2 / (1 - x^5 + x^3*(1 + x^3)^2 / ...))) in powers of x^2. - Michael Somos, Apr 20 2017
a(n) = A208933(4*n+1) - A215348(4*n+1) (conjectured). - Thomas Baruchel, May 14 2018
A(x^4) = (1/(m*x)) * ( chi(x)^m - chi(-x)^m ) / ( chi(x)^m + chi(-x)^m ) at m = 2, where chi(x) = Product_{i >= 0} (1 + x^(2*i+1)) is the g.f. of A000700. The formula gives generating functions related to A092869 when m = 1 and A001938 (also A093160) when m = 4. - Peter Bala, Sep 23 2023
Previous Showing 41-50 of 1364 results. Next