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-10 of 16 results. Next

A000118 Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.

Original entry on oeis.org

1, 8, 24, 32, 24, 48, 96, 64, 24, 104, 144, 96, 96, 112, 192, 192, 24, 144, 312, 160, 144, 256, 288, 192, 96, 248, 336, 320, 192, 240, 576, 256, 24, 384, 432, 384, 312, 304, 480, 448, 144, 336, 768, 352, 288, 624, 576, 384, 96, 456, 744, 576, 336, 432, 960, 576, 192
Offset: 0

Views

Author

Keywords

Comments

a^2 + b^2 + c^2 + d^2 is one of Ramanujan's 54 universal quaternary quadratic forms. - Michael Somos, Apr 01 2008
a(n) is also the number of quaternions q = a + bi + cj + dk, where a, b, c, d are integers, such that a^2 + b^2 + c^2 + d^2 = n (i.e., so that n is the norm of q). These are Lipschitz integer quaternions. - Rick L. Shepherd, Mar 27 2009
Number 5 and 35 of the 126 eta-quotients listed in Table 1 of Williams 2012. - Michael Somos, Nov 10 2018
This is the convolution square of A004018. - Pierre Abbat, May 15 2023

Examples

			G.f. = 1 + 8*q + 24*q^2 + 32*q^3 + 24*q^4 + 48*q^5 + 96*q^6 + 64*q^7 + 24*q^8 + ...
a(1)=8 counts 1 = 1^2 + 0^2 + 0^2 + 0^2 = 0^2 + 1^2 + 0^2 + 0^2 = 0^2 + 0^2 + 1^2 + 0^2 = 0^2 + 0^2 + 0^2 + 1^2 and 4 more sums where 1^2 is replaced by (-1)^2. - _R. J. Mathar_, May 16 2023
		

References

  • J. H. Conway and R. K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996, ch. 8, pp. 231-2.
  • J. H. Conway and N. J. A. Sloane, Sphere Packing, Lattices and Groups, Springer-Verlag, p. 108, Eq. (49).
  • N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 78, Eq. (32.28). See also top of p. 94.
  • E. Freitag and R. Busam, Funktionentheorie 1, 4. Auflage, Springer, 2006, p. 392.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 314, Theorem 386.
  • Carlos J. Moreno and Samuel S. Wagstaff, Jr., Sums of Squares of integers, Chapman & Hall/CRC, 2006, p. 29.
  • S. Ramanujan, Collected Papers, Chap. 20, Cambridge Univ. Press 1927 (Proceedings of the Camb. Phil. Soc., 19 (1917) 11-21).

Crossrefs

Row d=4 of A122141 and of A319574, 4th column of A286815.
For number of solutions to a^2+b^2+c^2+k*d^2=n for k=1, 2, 3, 4, 5, 6, 7, 8, 12, see A000118, A236928, A236926, A236923, A236930, A236931, A236932, A236927, A236933.

Programs

  • Haskell
    a000118 0 = 1
    a000118 n = 8 * a046897 n  -- Reinhard Zumkeller, Aug 12 2015
    
  • Julia
    # JacobiTheta3 is defined in A000122.
    A000118List(len) = JacobiTheta3(len, 4)
    A000118List(57) |> println # Peter Luschny, Mar 12 2018
    
  • MATLAB
    a(n) = 8 * sum(find(mod(n,1:n)==0 & mod(1:n,4))) + (n==0) % David Mellinger, Aug 04 2025
  • Magma
    A := Basis( ModularForms( Gamma0(4), 2), 57); A[1] + 8*A[2]; /* Michael Somos, Aug 21 2014 */
    
  • Maple
    (add(q^(m^2),m=-10..10))^4; seq(coeff(%,q,n), n=0..50);
    # Alternative:
    A000118list := proc(len) series(JacobiTheta3(0, x)^4, x, len+1);
    seq(coeff(%, x, j), j=0..len-1) end: A000118list(57); # Peter Luschny, Oct 02 2018
  • Mathematica
    Table[SquaresR[4, n], {n, 0, 46}]
    a[ n_] :=  SeriesCoefficient[ EllipticTheta[ 3, 0, q]^4, {q, 0, n}]; (* Michael Somos, Jun 12 2014 *)
    a[ n_] := If[ n < 1, Boole[ n == 0], 8 Sum[ If[ Mod[ d, 4] > 0, d, 0], {d, Divisors @ n }]]; (* Michael Somos, Feb 20 2015 *)
    QP = QPochhammer; CoefficientList[QP[-q]^8/QP[q^2]^4 + O[q]^60, q] (* Jean-François Alcover, Nov 24 2015 *)
  • PARI
    {a(n) = if( n<1, n==0, 8 * sumdiv( n, d, if( d%4, d)))}; /* Michael Somos, Apr 01 2003 */
    
  • PARI
    {a(n) = local(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x^2 + A)^5 / (eta(x + A)^2 * eta(x^4 + A)^2))^4, n))}; /* Michael Somos, Apr 01 2008 */
    
  • PARI
    q='q+O('q^66); Vec((eta(q^2)^5/(eta(q)^2*eta(q^4)^2))^4) /* Joerg Arndt, Apr 08 2013 */
    
  • PARI
    a(n) = 8*sigma(n) - if (n % 4, 0, 32*sigma(n/4)); \\ Michel Marcus, Jul 13 2016
    
  • Python
    from sympy import divisors
    def a(n): return 1 if n==0 else 8*sum(d for d in divisors(n) if d%4 != 0)
    print([a(n) for n in range(57)]) # Michael S. Branicky, Jan 08 2021
    
  • Python
    from sympy import divisor_sigma
    def A000118(n): return 1 if n == 0 else 8*divisor_sigma(n) if n % 2 else 24*divisor_sigma(int(bin(n)[2:].rstrip('0'),2)) # Chai Wah Wu, Jun 27 2022
    
  • Sage
    A = ModularForms( Gamma0(4), 2, prec=57) . basis(); A[0] + 8*A[1]; # Michael Somos, Jun 12 2014
    
  • Sage
    Q = DiagonalQuadraticForm(ZZ, [1]*4)
    Q.representation_number_list(60) # Peter Luschny, Jun 20 2014
    

Formula

G.f.: theta_3(q)^4 = (Product_{n>=1} (1-q^(2n))*(1+q^(2n-1))^2)^4 = eta(-q)^8/eta(q^2)^4; eta = Dedekind's function.
a(n) = 8*sigma(n) - 32*sigma(n/4) for n > 0, where the latter term is 0 if n is not a multiple of 4.
Euler transform of period 4 sequence [8, -12, 8, -4, ...]. - Michael Somos, Dec 16 2002
G.f. A(x) satisfies 0 = f(A(x), A(x^3), A(x^9)) where f(u, v, w) = v^4 - 30*u*v^2*w + 12*u*v*w*(u + 9*w) - u*w*(u^2 + 9*w*u + 81*w^2). - Michael Somos, Nov 02 2006
G.f. is a period 1 Fourier series which satisfies f(-1/(4*t)) = 4*(t/i)^2*f(t) where q = exp(2*Pi*i*t). - Michael Somos, Jan 25 2008
For n > 0, a(n)/8 is multiplicative and a(p^n)/8 = 1 + p + p^2 + ... + p^n for p an odd prime, a(2^n)/8 = 1 + 2 for n > 0.
a(n) = 8*A000203(n/A006519(n))*(2 + (-1)^n). - Benoit Cloitre, May 16 2002
G.f.: 1 + 8*Sum_{k>0} x^k / (1 + (-x)^k)^2 = 1 + 8*Sum_{k>0} k * x^k / (1 + (-x)^k).
G.f. = s(2)^20/(s(1)*s(4))^8, where s(k) := subs(q=q^k, eta(q)), where eta(q) is Dedekind's function, cf. A010815. [Fine]
Fine gives another explicit formula for a(n) in terms of the divisors of n.
a(n) = 8*A046897(n), n > 0. - Ralf Stephan, Apr 02 2003
A096727(n) = (-1)^n * a(n). a(2*n) = A004011(n). a(2*n + 1) = A005879(n).
Dirichlet g.f.: Sum_{n>=1} a(n)/n^s = 8*(1-4^(1-s))*zeta(s)*zeta(s-1). [Ramanu. J. 7 (2003) 95-127, eq (3.2)]. - R. J. Mathar, Jul 02 2012
Average value is (Pi^2/2)*n + O(sqrt(n)). - Charles R Greathouse IV, Feb 17 2015
From Wolfdieter Lang, Jan 14 2016: (Start)
For n >= 1: a(n) = 8*Sum_{d | n} b(d)*d, with b(d) = 1 if d/4 is not an integer else 0. See, e.g., the Freitag-Busam reference, p. 392.
For n >= 1: a(n) = 8*sigma(n) if n is odd else 24*sigma(m(n)), where m(n) is the largest odd divisor of n (see A000265), and sigma is given in A000203. See the Moreno-Wagstaff reference, Theorem 2. 6 (Jacobi), p. 29. (End)
a(n) = (8/n)*Sum_{k=1..n} A186690(k)*a(n-k), a(0) = 1. - Seiichi Manyama, May 27 2017

A008438 Sum of divisors of 2*n + 1.

Original entry on oeis.org

1, 4, 6, 8, 13, 12, 14, 24, 18, 20, 32, 24, 31, 40, 30, 32, 48, 48, 38, 56, 42, 44, 78, 48, 57, 72, 54, 72, 80, 60, 62, 104, 84, 68, 96, 72, 74, 124, 96, 80, 121, 84, 108, 120, 90, 112, 128, 120, 98, 156, 102, 104, 192, 108, 110, 152, 114, 144, 182, 144, 133, 168
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 of writing n as the sum of 4 triangular numbers.
Bisection of A000203. - Omar E. Pol, Mar 14 2012
a(n) is also the total number of parts in all partitions of 2*n + 1 into equal parts. - Omar E. Pol, Feb 14 2021

Examples

			Divisors of 9 are 1,3,9, so a(4)=1+3+9=13.
F_2(z) = eta(4z)^8/eta(2z)^4 = q + 4q^3 + 6q^5 +8q^7 + 13q^9 + ...
G.f. = 1 + 4*x + 6*x^2 + 8*x^3 + 13*x^4 + 12*x^5 + 14*x^6 + 24*x^7 + 18*x^8 + 20*x^9 + ...
B(q) = q + 4*q^3 + 6*q^5 + 8*q^7 + 13*q^9 + 12*q^11 + 14*q^13 + 24*q^15 + 18*q^17 + ...
		

References

  • B. C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, see p. 139 Ex. (iii).
  • J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 102.
  • L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 19 eq. (6), and p. 283 eq. (8).
  • W. Dunham, Euler: The Master of Us All, The Mathematical Association of America Inc., Washington, D.C., 1999, p. 12.
  • H. M. Farkas, I. Kra, Cosines and triangular numbers, Rev. Roumaine Math. Pures Appl., 46 (2001), 37-43.
  • N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 79, Eq. (32.31).
  • N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 184, Prop. 4, F(z).
  • G. Polya, Induction and Analogy in Mathematics, vol. 1 of Mathematics and Plausible Reasoning, Princeton Univ. Press, 1954, page 92 ff.

Crossrefs

Number of ways of writing n as a sum of k triangular numbers, for k=1,...: A010054, A008441, A008443, A008438, A008439, A008440, A226252, A007331, A226253, A226254, A226255, A014787, A014809.

Programs

  • Haskell
    a008438 = a000203 . a005408  -- Reinhard Zumkeller, Sep 22 2014
    
  • Magma
    Basis( ModularForms( Gamma0(4), 2), 124) [2]; /* Michael Somos, Jun 12 2014 */
    
  • Magma
    [DivisorSigma(1, 2*n+1): n in [0..70]]; // Vincenzo Librandi, Aug 01 2017
  • Maple
    A008438 := proc(n) numtheory[sigma](2*n+1) ; end proc: # R. J. Mathar, Mar 23 2011
  • Mathematica
    DivisorSigma[1, 2 # + 1] & /@ Range[0, 61] (* Ant King, Dec 02 2010 *)
    a[ n_] := SeriesCoefficient[ D[ Series[ Log[ QPochhammer[ -x] / QPochhammer[ x]], {x, 0, 2 n + 1}], x], {x, 0 , 2n}]; (* Michael Somos, Oct 15 2019 *)
  • PARI
    {a(n) = if( n<0, 0, sigma( 2*n + 1))};
    
  • PARI
    {a(n) = if( n<0, 0, n = 2*n; polcoeff( sum( k=1, (sqrtint( 4*n + 1) + 1)\2, x^(k^2 - k), x * O(x^n))^4, n))}; /* Michael Somos, Sep 17 2004 */
    
  • PARI
    {a(n) = my(A); if( n<0, 0, n = 2*n; A = x * O(x^n); polcoeff( (eta(x^4 + A)^2 / eta(x^2 + A))^4, n))}; /* Michael Somos, Sep 17 2004 */
    
  • Sage
    ModularForms( Gamma0(4), 2, prec=124).1;  # Michael Somos, Jun 12 2014
    

Formula

Expansion of q^(-1/2) * (eta(q^2)^2 / eta(q))^4 = psi(q)^4 in powers of q where psi() is a Ramanujan theta function. - Michael Somos, Apr 11 2004
Expansion of Jacobi theta_2(q)^4 / (16*q) in powers of q^2. - Michael Somos, Apr 11 2004
Euler transform of period 2 sequence [4, -4, 4, -4, ...]. - Michael Somos, Apr 11 2004
a(n) = b(2*n + 1) where b() is multiplicative and b(2^e) = 0^n, b(p^e) =(p^(e+1) - 1) / (p - 1) if p>2. - Michael Somos, Jul 07 2004
Given g.f. A(x), then B(q) = q * A(q^2) satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = v^3 + 8*w*v^2 + 16*w^2*v - u^2*w - Michael Somos, Apr 08 2005
Given g.f. A(x), then B(q) = q * A(q^2) satisfies 0 = f(B(q), B(q^3), B(q^9)) where f(u, v, w) = v^4 - 30*u*v^2*w + 12*u*v*w*(u + 9*w) - u*w*(u^2 + 9*w*u + 81*w^2).
Given g.f. A(x), then B(q) = q * A(q^2) satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u2^3 + u1^2*u6 + 3*u2*u3^2 + 27*u6^3 - u1*u2*u3 - 3*u1*u3*u6 - 7*u2^2*u6 - 21*u2*u6^2. - Michael Somos, May 30 2005
G.f.: Sum_{k>=0} (2k + 1) * x^k / (1 - x^(2k + 1)).
G.f.: (Product_{k>0} (1 - x^k) * (1 + x^k)^2)^4. - Michael Somos, Apr 11 2004
G.f. Sum_{k>=0} a(k) * x^(2*k + 1) = x * (Product_{k>0} (1 - x^(4*k))^2 / (1 - x^(2*k)))^4 = x * (Sum_{k>0} x^(k^2 - k))^4 = Sum_{k>0} k * (x^k / (1 - x^k) - 3 * x^(2*k) / (1 - x^(2*k)) + 2 * x^(4*k) / (1 - x^(4*k))). - Michael Somos, Jul 07 2004
Number of solutions of 2*n + 1 = (x^2 + y^2 + z^2 + w^2) / 4 in positive odd integers. - Michael Somos, Apr 11 2004
8 * a(n) = A005879(n) = A000118(2*n + 1). 16 * a(n) = A129588(n). a(n) = A000593(2*n + 1) = A115607(2*n + 1).
a(n) = A000203(2*n+1). - Omar E. Pol, Mar 14 2012
G.f. is a period 1 Fourier series which satisfies f(-1 / (4 t)) = (1/4) (t/i)^2 g(t) where q = exp(2 Pi i t) and g() is the g.f. for A096727. Michael Somos, Jun 12 2014
a(0) = 1, a(n) = (4/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 4*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017
From Peter Bala, Jan 10 2021: (Start)
a(n) = A002131(2*n+1).
G.f.: Sum_{n >= 0} x^n*(1 + x^(2*n+1))/(1 - x^(2*n+1))^2. (End)
Sum_{k=1..n} a(k) ~ Pi^2 * n^2 / 8. - Vaclav Kotesovec, Aug 07 2022
Convolution of A125061 and A138741. - Michael Somos, Mar 04 2023

Extensions

Comments from Len Smiley, Enoch Haga

A004011 Theta series of D_4 lattice; Fourier coefficients of Eisenstein series E_{gamma,2}.

Original entry on oeis.org

1, 24, 24, 96, 24, 144, 96, 192, 24, 312, 144, 288, 96, 336, 192, 576, 24, 432, 312, 480, 144, 768, 288, 576, 96, 744, 336, 960, 192, 720, 576, 768, 24, 1152, 432, 1152, 312, 912, 480, 1344, 144, 1008, 768, 1056, 288, 1872, 576, 1152, 96, 1368, 744, 1728, 336
Offset: 0

Views

Author

Keywords

Comments

D_4 is also the Barnes-Wall lattice in 4 dimensions.
E_{gamma,2} is the unique normalized modular form for Gamma_0(2) of weight 2.
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).
Ramanujan's Eisenstein series: P(q) (see A006352), Q(q) (A004009), R(q) (A013973).
Convolution square is A008658. - Michael Somos, Aug 21 2014
Expansion of 2*P(x^2) - P(x) in powers of x where P() is a Ramanujan Eisenstein series. - Michael Somos, Feb 16 2015
a(n) is the number of Hurwitz quaternions of norm n. - Michael Somos, Feb 16 2015

Examples

			G.f. = 1 + 24*x + 24*x^2 + 96*x^3 + 24*x^4 + 144*x^5 + 96*x^6 + 192*x^7 + 24*x^8 + ...
G.f. = 1 + 24*q^2 + 24*q^4 + 96*q^6 + 24*q^8 + 144*q^10 + 96*q^12 + 192*q^14 + 24*q^16 + ...
		

References

  • Bruce C. Berndt, Ramanujan's Notebooks Part V, Springer-Verlag, 1998, see p. 148 Eq. (9.11).
  • Harvey Cohn, Advanced Number Theory, Dover Publications, Inc., 1980, p. 89. Eq. (1).
  • J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 119.
  • S. Ramanujan, Notebooks, Tata Institute of Fundamental Research, Bombay 1957 Vol. 1, see page 214.
  • N. J. A. Sloane, Seven Staggering Sequences, in Homage to a Pied Puzzler, E. Pegg Jr., A. H. Schoen and T. Rodgers (editors), A. K. Peters, Wellesley, MA, 2009, pp. 93-110.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Partial sums give A046949.
Cf. A108092 (convolution fourth root).

Programs

  • Magma
    Basis( ModularForms( Gamma0(2), 2), 54) [1]; /* Michael Somos, May 27 2014 */
    
  • Maple
    readlib(ifactors): with(numtheory): for n from 1 to 100 do if n mod 2 = 0 then m := n/ifactors(n)[2][1][1]^ifactors(n)[2][1][2] else m := n fi: printf(`%d,`,24*sigma(m)) od: # James Sellers, Dec 07 2000
  • Mathematica
    a[ n_] := If[ n < 0, 0, With[ {m = Floor @ Sqrt[4 n]}, SeriesCoefficient[ Sum[ q^( x^2 + y^2 + z^2 + t^2 + (x + y + z) t ), {x, -m, m}, {y, -m, m}, {z, -m, m}, {t, -m, m}] + O[q]^(n + 1), n]]]; (* Michael Somos, Jan 11 2011 *)
    a[n_] := 24*Total[ Select[ Divisors[n], OddQ]]; a[0]=1; Table[a[n], {n, 0, 52}] (* Jean-François Alcover, Sep 12 2012 *)
    a[ n_] := With[{m = InverseEllipticNomeQ @q}, SeriesCoefficient[ (1 + m) (EllipticK[ m] / (Pi/2))^2, {q, 0, n}]]; (* Michael Somos, Jun 04 2013 *)
    a[ n_] := With[{m = InverseEllipticNomeQ @q}, SeriesCoefficient[ (1 - m/2) (EllipticK[ m] / (Pi/2))^2, {q, 0, 2 n}]]; (* Michael Somos, Jun 04 2013 *)
    a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, q]^4 + EllipticTheta[ 2, 0, q]^4, {q, 0, n}]; (* Michael Somos, Jun 04 2013 *)
    a[ n_] := SeriesCoefficient[ (EllipticTheta[ 3, 0, q]^4 + EllipticTheta[ 4, 0, q]^4) / 2, {q, 0, 2 n}]; (* Michael Somos, Jun 04 2013 *)
  • PARI
    {a(n) = if( n<1, n==0, 24 * sumdiv( n, d, d%2 * d))}; /* Michael Somos, Apr 17 2000 */
    
  • PARI
    {a(n) = my(G); if( n<0, 0, G = [2, 1, 1, 1; 1, 2, 0, 0; 1, 0, 2, 0; 1, 0, 0, 2]; polcoeff( 1 + 2 * x * Ser(qfrep( G, n, 1)), n))}; /* Michael Somos, Sep 11 2007 */
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^2 + A)^20 / (eta(x + A) * eta(x^4 + A))^8 + 16 * x * eta(x^4 + A)^8 / eta(x^2 + A)^4, n))}; /* Michael Somos, Oct 21 2017 */
    
  • Python
    from sympy import divisors
    def a(n): return 1 if n==0 else 24*sum(d for d in divisors(n) if d%2)
    print([a(n) for n in range(101)]) # Indranil Ghosh, Jun 24 2017
    
  • Python
    from math import prod
    from sympy import factorint
    def A004011(n): return 24*prod((p**(e+1)-1)//(p-1) for p, e in factorint(n).items() if p > 2) if n else 1 # Chai Wah Wu, Nov 13 2022
  • Sage
    ModularForms( Gamma0(2), 2, prec=54).0; # Michael Somos, Jun 04 2013
    

Formula

a(0) = 1; if n>0 then a(n) = 24 (Sum_{d|n, d odd, d>0} d) = 24 * A000593(n).
G.f.: 1 + 24 Sum_{n>0} n x^n /(1 + x^n). a(n) = A000118(2*n) = A096727(2*n).
G.f.: (1/2) * (theta_3(z)^4 + theta_4(z)^4) = theta_3(2z)^4 + theta_2(2z)^4 = Sum_{k>=0} a(k) * x^(2*k).
G.f.: Sum_{a, b, c, d in Z} x^(a^2 + b^2 + c^2 + d^2 + a*d + b*d + c*d). - Michael Somos, Jan 11 2011
Expansion of (1 + k^2) * K(k^2)^2 / (Pi/2)^2 in powers of nome q. - Michael Somos, Jun 10 2006
Expansion of (1 - k^2/2) * K(k^2)^2 / (Pi/2)^2 in powers of nome q^2. - Michael Somos, Mar 14 2012
Expansion of b(x) * b(x^2) + 3 * c(x) * c(x^2) in powers of x where b(), c() are cubic AGM theta functions. - Michael Somos, Jan 11 2011
Expansion of b(x) * b(x^2) + c(x) * c(x^2) / 3 in powers of x^3 where b(), c() are cubic AGM theta functions. - Michael Somos, Mar 14 2012
G.f. is a period 1 Fourier series which satisfies f(-1 / (2 t)) = 2 (t/i)^2 f(t) where q = exp(2 Pi i t). - Michael Somos, Sep 11 2007
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u^2 - 2*u*v - 7*v^2 - 8*v*w + 16*w^2. - Michael Somos, May 29 2005
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u1^2 + 4*u2^2 + 9*u3^2 + 36*u6^2 - 2*u1*u2 - 10*u1*u3 + 10*u1*u6 + 10*u2*u3 - 40*u2*u6 - 18*u3*u6. - Michael Somos, Sep 11 2007
Sum_{k=1..n} a(k) ~ c * n^2, where c = Pi^2 = 9.869604... (A002388). - Amiram Eldar, Dec 29 2023

Extensions

Additional comments from Barry Brent (barryb(AT)primenet.com)

A035016 Fourier coefficients of E_{0,4}.

Original entry on oeis.org

1, -16, 112, -448, 1136, -2016, 3136, -5504, 9328, -12112, 14112, -21312, 31808, -35168, 38528, -56448, 74864, -78624, 84784, -109760, 143136, -154112, 149184, -194688, 261184, -252016, 246176, -327040, 390784, -390240, 395136, -476672, 599152, -596736
Offset: 0

Views

Author

Barry Brent (barryb(AT)primenet.com)

Keywords

Comments

E_{0,4} is unique normalized entire modular form of weight 4 for \Gamma_0(2) with a zero at zero. Also |a(n)| matches expansion of theta_3(z)^8 (A000143).
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Examples

			G.f. = 1 - 16*q + 112*q^2 - 448*q^3 + 1136*q^4 - 2016*q^5 + 3136*q^6 - 5504*q^7 + ...
		

References

  • N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 77, Eq. (31.61).

Crossrefs

Programs

  • Julia
    # JacobiTheta4 is defined in A002448.
    A035016List(len) = JacobiTheta4(len, 8)
    A035016List(34) |> println # Peter Luschny, Mar 12 2018
  • Maple
    a_list := proc(len) series(JacobiTheta4(0,x)^8,x,len+1); seq(coeff(%,x,j),j=0..len) end: a_list(33); # Peter Luschny, Mar 14 2017
  • Mathematica
    a[0] = 1; a[n_] := 16*Sum[(-1)^d*d^3, {d, Divisors[n]}]; Table[a[n], {n, 0, 33}] (* Jean-François Alcover, Feb 06 2012, after Pari *)
    QP = QPochhammer; s = QP[q]^16/QP[q^2]^8 + O[q]^40; CoefficientList[s, q] (* Jean-François Alcover, Nov 25 2015 *)
  • PARI
    {a(n) = if( n<1, n==0, 16 * sumdiv( n, d, (-1)^d * d^3))};
    
  • PARI
    {a(n) = if( n<0, 0, polcoeff( prod( k=1, n, (1 - x^k) / (1 + x^k), 1 + x * O(x^n))^8, n))};
    
  • PARI
    {a(n) = local(A); if( n<0, 0, A = x^n * O(x); polcoeff( (eta(x + A)^2 / eta(x^2 + A))^8, n))}; /* Michael Somos, Jan 11 2009 */
    
  • Python
    from sympy import divisors
    def a(n): return 1 if n==0 else 16*sum((-1)**d*d**3 for d in divisors(n))
    print([a(n) for n in range(101)]) # Indranil Ghosh, Jun 24 2017
    
  • Sage
    A = ModularForms( Gamma0(4), 4, prec=34) . basis(); A[0] - 16*A[1] + 112*A[2]; # Michael Somos, Jun 15 2014
    

Formula

a(0)=1; for n>0, a(n) = 16*sum_{0
G.f.: Product_{n>=1} ((1-q^n)/(1+q^n))^8 [Fine]
Expansion of phi(-q)^8 in powers of q where phi() is a Ramanujan theta function. - Michael Somos, Jun 15 2014
Expansion of eta(q)^16 / eta(q^2)^8 in powers of q.
Euler transform of period 2 sequence [ -16, -8, ...]. - Michael Somos, Apr 10 2005
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = v^3 + u*v * (u - 2*v + 16*w) - 16 * u*w^2. - Michael Somos, Apr 10 2005
G.f. is a period 1 Fourier series which satisfies f(-1 / (2 t)) = 256 (t / i)^4 g(t) where q = exp(2 Pi i t) and g() is the g.f. for A007331. - Michael Somos, Jan 11 2009
a(n) = (-1)^n * A000143(n).
Convolution square of A096727. - Michael Somos, Jun 15 2014

A109506 Expansion of (1 - phi(-q)^4)/ 8 in powers of q where phi() is a Ramanujan theta function.

Original entry on oeis.org

1, -3, 4, -3, 6, -12, 8, -3, 13, -18, 12, -12, 14, -24, 24, -3, 18, -39, 20, -18, 32, -36, 24, -12, 31, -42, 40, -24, 30, -72, 32, -3, 48, -54, 48, -39, 38, -60, 56, -18, 42, -96, 44, -36, 78, -72, 48, -12, 57, -93, 72, -42, 54, -120, 72, -24, 80, -90, 60, -72, 62, -96, 104, -3, 84, -144, 68, -54, 96, -144, 72
Offset: 1

Author

Michael Somos, Jun 30 2005

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Denoted by xi(n) in Glaisher 1907. - Michael Somos, May 17 2013

Examples

			q - 3*q^2 + 4*q^3 - 3*q^4 + 6*q^5 - 12*q^6 + 8*q^7 - 3*q^8 + 13*q^9 + ...
		

References

  • G. Chrystal, Algebra: An elementary text-book for the higher classes of secondary schools and for colleges, 6th ed, Chelsea Publishing Co., New York 1959 Part II, p. 346 Exercise XXI(18). MR0121327 (22 #12066).
  • J. W. L. Glaisher, On the representations of a number as the sum of two, four, six, eight, ten, and twelve squares, Quart. J. Math. 38 (1907), 1-62 (see p. 8).

Programs

  • Mathematica
    a[ n_] := If[ n < 1, 0, -(-1)^n Sum[ If[ Mod[ d, 4] == 0, 0, d], {d, Divisors@n}]] (* Michael Somos, May 17 2013 *)
  • PARI
    {a(n) = if( n<1, 0, -(-1)^n * sumdiv( n, d, if( d%4, d)))}
    
  • PARI
    {a(n) = local(A); if( n<1, 0, A = x * O(x^n); -1/8 * polcoeff( eta(x + A)^8 / eta(x^2 + A)^4, n))}

Formula

Expansion of (1 - eta(q)^8 / eta(q^2)^4) / 8 in powers of q.
a(n) = Sum_{d divides n} (-1)^(n/d + d) * d [Glaisher].
Multiplicative with a(2^e) = -3, if e>0. a(p^e) = (p^(e+1) - 1) / (p - 1) if p>2.
G.f.: Sum_{k>0} k * (x^k / (1 - x^k) - 6 * x^(2*k) / (1 - x^(2*k)) + 8 * x^(4*k) / (1 - x^(4*k))).
G.f.: Sum_{k>0} -(-x)^k / (1 + x^k)^2 = Sum_{k>0} - k * (-x)^k / (1 + x^k).
a(n) = -(-1)^n * A046897(n). a(n) = -A096727(n) / 8 unless n=0. a(2*n) = -3 * A000593(n). a(2*n + 1) = A008438(n). a(4*n + 1) = A112610(n). a(4*n + 3) = A097723(n).
Dirichlet g.f.: (1 - 1/2^(s-2)) * (1 - 1/2^(s-1)) * zeta(s-1) * zeta(s). - Amiram Eldar, Sep 12 2023

A284286 Expansion of eta(q^2)^4 / eta(q)^8 in powers of q.

Original entry on oeis.org

1, 8, 40, 160, 552, 1712, 4896, 13120, 33320, 80872, 188784, 425952, 932640, 1988080, 4137024, 8422848, 16810536, 32943760, 63482760, 120440608, 225217904, 415498496, 756920160, 1362645440, 2425895712, 4273590392, 7454092720, 12879684160, 22056267840
Offset: 0

Author

Seiichi Manyama, May 02 2017

Keywords

Crossrefs

Column k=4 of A288515.

Programs

Formula

a(n) = (-1)^n * A004405(n).
a(0) = 1, a(n) = (8/n)*Sum_{k=1..n} A002131(k)*a(n-k) for n > 0.
G.f.: Prod_{k>0} (1 - x^(2k))^4 / (1 - x^k)^8.

A319307 Expansion of theta_4(q)^16 in powers of q = exp(Pi i t).

Original entry on oeis.org

1, -32, 480, -4480, 29152, -140736, 525952, -1580800, 3994080, -8945824, 18626112, -36714624, 67978880, -118156480, 197120256, -321692928, 509145568, -772845120, 1143441760, -1681379200, 2428524096, -3392205824, 4658843520, -6411152640, 8705492608, -11488092896
Offset: 0

Author

Seiichi Manyama, Sep 16 2018

Keywords

Crossrefs

theta_4(q)^b: A002448 (b=1), A104794 (b=2), A213384 (b=3), A096727 (b=4), A035016 (b=8), A286346 (b=12), this sequence (b=16), A319308 (b=20), A319309 (b=24), A319310 (b=28).
Cf. A000152.

Formula

Expansion of eta(q)^32 / eta(q^2)^16 in powers of q.

A319308 Expansion of theta_4(q)^20 in powers of q = exp(Pi i t).

Original entry on oeis.org

1, -40, 760, -9120, 77560, -497648, 2508000, -10232640, 34729720, -100906760, 259114704, -606957280, 1327461600, -2738111280, 5341699520, -9915552192, 17701924600, -30615844560, 51294999960, -83279292960, 131880275664, -204949382400, 312126610080, -464844224960, 680432137440
Offset: 0

Author

Seiichi Manyama, Sep 16 2018

Keywords

Crossrefs

theta_4(q)^b: A002448 (b=1), A104794 (b=2), A213384 (b=3), A096727 (b=4), A035016 (b=8), A286346 (b=12), A319307 (b=16), this sequence (b=20), A319309 (b=24), A319310 (b=28).

Formula

Expansion of eta(q)^40 / eta(q^2)^20 in powers of q.

A319309 Expansion of theta_4(q)^24 in powers of q = exp(Pi i t).

Original entry on oeis.org

1, -48, 1104, -16192, 170064, -1362336, 8662720, -44981376, 195082320, -721175536, 2319457632, -6631997376, 17231109824, -41469483552, 93703589760, -200343312768, 407488018512, -793229226336, 1487286966928, -2697825744960, 4744779429216, -8110465650176
Offset: 0

Author

Seiichi Manyama, Sep 16 2018

Keywords

Crossrefs

theta_4(q)^b: A002448 (b=1), A104794 (b=2), A213384 (b=3), A096727 (b=4), A035016 (b=8), A286346 (b=12), A319307 (b=16), A319308 (b=20), this sequence (b=24), A319310 (b=28).
Cf. A000156.

Formula

Expansion of eta(q)^48 / eta(q^2)^24 in powers of q.

A319310 Expansion of theta_4(q)^28 in powers of q = exp(Pi i t).

Original entry on oeis.org

1, -56, 1512, -26208, 327656, -3147984, 24189984, -152867520, 811401192, -3681079640, 14500933104, -50376047904, 156797510688, -444306558864, 1163495873088, -2851049839680, 6597606440936, -14512424533488, 30505974273096, -61591664700384, 119983597365744, -226303038736128
Offset: 0

Author

Seiichi Manyama, Sep 16 2018

Keywords

Crossrefs

theta_4(q)^b: A002448 (b=1), A104794 (b=2), A213384 (b=3), A096727 (b=4), A035016 (b=8), A286346 (b=12), A319307 (b=16), A319308 (b=20), A319309 (b=24), this sequence (b=28).

Formula

Expansion of eta(q)^56 / eta(q^2)^28 in powers of q.
Showing 1-10 of 16 results. Next