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 26 results. Next

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

Original entry on oeis.org

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

Views

Author

Keywords

Comments

Number of partitions of n into an even number of distinct parts minus number of partitions of n into an odd number of distinct parts, with 2 types of each part. E.g., for n=4, we consider k and k* to be different versions of k and so we have 4, 4*, 31, 31*, 3*1, 3*1*, 22*, 211*, 2*11*. The even partitions number 5 and the odd partitions number 4, so a(4)=5-4=1. - Jon Perry, Apr 04 2004
Also, number of partitions of n into parts of -2 different kinds (based upon formal analogy). - Michele Dondi (blazar(AT)lcm.mi.infn.it), Jun 29 2004
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number 68 of the 74 eta-quotients listed in Table I of Martin (1996).

Examples

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

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

Cf. A000712 (reciprocal of g.f.), A010815, A010816, A258406.
Powers of Euler's product: A000594, A000727 - A000731, A000735, A000739, A010815 - A010840.

Programs

  • Julia
    # DedekindEta is defined in A000594.
    A002107List(len) = DedekindEta(len, 2)
    A002107List(78) |> println # Peter Luschny, Mar 09 2018
  • Magma
    Basis( CuspForms( Gamma1(144), 1), 926) [1]; /* Michael Somos, May 17 2015 */
    
  • Maple
    A010816 := proc (n); if frac(sqrt(8*n+1)) = 0 then (-1)^((1/2)*isqrt(8*n+1)-1/2)*isqrt(8*n+1) else 0 end if; end proc:
    N := 10:
    a := proc (n) option remember; if n < 0 then 0 else A010816(n) + add( (-1)^(k+1)*a(n - (1/2)*k*(3*k-1) ), k = -N..-1) + add( (-1)^(k+1)*a(n - (1/2)*k*(3*k-1) ), k = 1..N) end if; end proc:
    seq(a(n), n = 0..100); # Peter Bala, Apr 06 2022
  • Mathematica
    terms = 78; Clear[s]; s[n_] := s[n] = Product[(1 - x^k)^2, {k, 1, n}] // Expand // CoefficientList[#, x]& // Take[#, terms]&; s[n = 10]; s[n = 2*n]; While[s[n] != s[n - 1], n = 2*n]; A002107 = s[n] (* Jean-François Alcover, Jan 17 2013 *)
    a[ n_] := SeriesCoefficient[ QPochhammer[ x]^2, {x, 0, n}]; (* Michael Somos, Jan 31 2015 *)
    a[ n_] := SeriesCoefficient[ Product[ 1 - x^k, {k, n}]^2, {x, 0, n}]; (* Michael Somos, Jan 31 2015 *)
  • PARI
    {a(n) = my(A, p, e, x); if( n<0, 0, n = 12*n + 1; A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k,]; if( p<5, 0, p%12>1, if( e%2, 0, (-1)^((p%12==5) * e/2)), for( i=1, sqrtint(p\9), if( issquare(p - 9*i^2), x=i; break)); (e + 1) * (-1)^(e*x))))}; /* Michael Somos, Aug 30 2006 */
    
  • PARI
    {a(n) = if( n<0, 0, polcoeff( eta(x + x * O(x^n))^2, n))}; /* Michael Somos, Aug 30 2006 */
    
  • PARI
    Vec(eta(x)^2) \\ Charles R Greathouse IV, Apr 22 2016
    

Formula

Expansion of q^(-1/12) * eta(q)^2 in powers of q. - Michael Somos, Mar 06 2012
Euler transform of period 1 sequence [ -2, ...]. - Michael Somos, Mar 06 2012
a(n) = b(12*n + 1) where b(n) is multiplicative and b(2^e) = b(3^e) = 0^e, b(p^e) = (1 + (-1)^e) / 2 if p == 7, 11 (mod 12), b(p^e) = (-1)^(e/2) * (1 + (-1)^e) / 2 if p == 5 (mod 12), b(p^e) = (e + 1) * (-1)^(e*x) if p == 1 (mod 12) where p = x^2 + 9*y^2. - Michael Somos, Sep 16 2006
Convolution inverse of A000712.
a(0) = 1, a(n) = -(2/n)*Sum{k = 0..n-1} a(k)*sigma_1(n-k). - Joerg Arndt, Feb 05 2011
Expansion of f(-x)^2 in powers of x where f() is a Ramanujan theta function. - Michael Somos, May 17 2015
G.f. is a period 1 Fourier series which satisfies f(-1 / (144 t)) = 12 (t/i) f(t) where q = exp(2 Pi i t). - Michael Somos, May 17 2015
a(n) = Sum_{k=0..n} A010815(k)*A010815(n-k); self convolution of A010815. - Gevorg Hmayakyan, Sep 18 2016
G.f.: Sum_{m, n in Z, n >= 2*|m|} (-1)^n * x^((3*(2*n + 1)^2 - (6*m + 1)^2)/24). - Seiichi Manyama, Oct 01 2016
G.f.: exp(-2*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
From Peter Bala, Jan 02 2021: (Start)
For prime p congruent to 5, 7 or 11 (mod 12), a(n*p^2 + (p^2 - 1)/12) = e*a(n), where e = 1 if p == 7 or 11 (mod 12) and e = -1 if p == 5 (mod 12).
If n and p are coprime then a(n*p + (p^2 - 1)/12) = 0. See Cooper et al., Theorem 1. (End)
With the convention that a(n) = 0 for n < 0 we have the recurrence a(n) = A010816(n) + Sum_{k a nonzero integer} (-1)^(k+1)*a(n - k*(3*k-1)/2), where A010816(n) = (-1)^m*(2*m+1) if n = m*(m + 1)/2, with m positive, is a triangular number else equals 0. For example, n = 10 = (4*5)/2 is a triangular number, A010816(10) = 9, and so a(10) = 9 + a(9) + a(8) - a(5) - a(3) = 9 - 2 - 2 - 2 - 2 = 1. - Peter Bala, Apr 06 2022

A000731 Expansion of Product (1 - x^k)^8 in powers of x.

Original entry on oeis.org

1, -8, 20, 0, -70, 64, 56, 0, -125, -160, 308, 0, 110, 0, -520, 0, 57, 560, 0, 0, 182, -512, -880, 0, 1190, -448, 884, 0, 0, 0, -1400, 0, -1330, 1000, 1820, 0, -646, 1280, 0, 0, -1331, -2464, 380, 0, 1120, 0, 2576, 0, 0, -880, 1748, 0, -3850, 0, -3400, 0, 2703, 4160, -2500, 0, 3458
Offset: 0

Views

Author

Keywords

Comments

Number 22 of the 74 eta-quotients listed in Table I of Martin (1996).
Denoted by g_4(q) in Cynk and Hulek in Remark 3.4 on page 12 as the unique level 9 form of weight 4.
This is a member of an infinite family of integer weight modular forms. g_1 = A033687, g_2 = A030206, g_3 = A130539, g_4 = A000731. - Michael Somos, Aug 24 2012
a(n)=0 if and only if A033687(n)=0 (see the Han-Ono paper). - Emeric Deutsch, May 16 2008
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).

Examples

			G.f. = 1 - 8*x + 20*x^2 - 70*x^3 + 64*x^4 + 56*x^5 - 125*x^6 - 160*x^7 + ...
G.f. = q - 8*q^4 + 20*q^7 - 70*q^13 + 64*q^16 + 56*q^19 - 125*q^25 - ...
		

References

  • Newman, Morris; A table of the coefficients of the powers of eta(tau). Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216.
  • 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

Powers of Euler's product: A000594, A000727 - A000731, A000735, A000739, A002107, A010815 - A010840.

Programs

  • Magma
    Basis( CuspForms( Gamma0(9), 4), 56) [1]; /* Michael Somos, Dec 09 2013 */
  • Mathematica
    a[ n_] := SeriesCoefficient[ QPochhammer[ x]^8, {x, 0, n}]; (* Michael Somos, Sep 29 2011 *)
    a[ n_] := SeriesCoefficient[ Product[ 1 - x^k, {k, n}]^8, {x, 0, n}]; (* Michael Somos, Dec 09 2013 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( eta(x + x * O(x^n))^8, n))};
    
  • PARI
    {a(n) = my(A, p, e, x, y, a0, a1); if( n<0, 0, n = 3*n + 1; A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==3, 0, p%3==2, if( e%2, 0, (-1)^(e/2) * p^(3*e/2)), forstep( y=sqrtint(4*p\3), sqrtint(p\3), -1, if( issquare( 4*p - 3*y^2, &x), if( x%3!=2, x=-x); break)); a0=1; a1 = y = x * (x^2 - 3*p); for( i=2, e, x = y*a1 - p^3*a0; a0=a1; a1=x); a1)))}; /* Michael Somos, Aug 23 2006 */
    
  • Sage
    CuspForms( Gamma0(9), 4, prec=56).0; # Michael Somos, May 28 2013
    

Formula

Expansion of q^(-1/3) * eta(q)^8 in powers of q.
Expansion of q^(-1/3) * b(q)^3 * c(q) / 3 in powers of q where b(), c() are cubic AGM theta functions. - Michael Somos, Nov 08 2006
Expansion of q^(-1) * b(q) * c(q)^3 / 27 in powers of q^3 where b(), c() are cubic AGM theta functions. - Michael Somos, Nov 08 2006
Euler transform of period 1 sequence [ -8, ...].
a(n) = b(3*n + 1) where b(n) is multiplicative and b(3^e) = 0^e, b(p^e) = (1 + (-1)^e)/2 * (-1)^(e/2) * p^(3*e/2) if p == 2 (mod 3), b(p^e) = b(p)*b(p^(e-1)) - b(p^(e-2))*p^3 if p == 1 (mod 3) where b(p) = (x^2 - 3*p)*x, 4*p = x^2 + 3*y^2, |x|<|y| and x == 2 (mod 3). - Michael Somos, Aug 23 2006
Given g.f. A(x), then B(x) = x * A(x^3) satisfies 0 = f(B(x), B(x^2), B(x^4)) where f(u, v, w) = v^3 - u * w * (u + 16 * w). - Michael Somos, Feb 19 2007
G.f. is a period 1 Fourier series which satisfies f(-1 / (9 t)) = 81 (t/i)^4 f(t) where q = exp(2 Pi i t). - Michael Somos, Sep 29 2011
G.f.: Product_{k>0} (1 - x^k)^8.
a(2*n) = A153728(n). - Michael Somos, Sep 29 2011
a(4*n + 1) = -8 * a(n). - Michael Somos, Dec 06 2004
a(4*n + 3) = a(16*n + 13) = 0. - Michael Somos, Oct 19 2005
A092342(n) = a(n) + 81*A033690(n-1). - Michael Somos, Aug 22 2007
Sum_{n>=0} a(n) * q^(3*n + 1) = (Sum_{i,j,k in Z} (i-j) * (j-k) * (k-i) * q^((i*i + j*j + k*k) / 2)) / 2 where 0 = i+j+k, i == 1 (mod 3), j == 2 (mod 3), and k == 0 (mod 3). - Michael Somos, Sep 22 2014
a(0) = 1, a(n) = -(8/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 27 2017
G.f.: exp(-8*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
Let M = p_1*...*p_k be a positive integer whose prime factors p_i (not necessarily distinct) are all congruent to 2 (mod 3). Then a( M^2*n + (M^2 - 1)/3 ) = (-1)^k*M^3*a(n). See Cooper et al., Theorem 1. - Peter Bala, Dec 01 2020
a(n) = b(3*n + 1) where b(n) is multiplicative and b(3^e) = 0^e, b(p^e) = (1 + (-1)^e)/2 * (-p^3)^(e/2) if p == 2 (mod 3), b(p^e) = (((x+sqrt(-3)*y)/2)^(3*e+3) - ((x-sqrt(-3)*y)/2)^(3*e+3))/(((x+sqrt(-3)*y)/2)^3 - ((x-sqrt(-3)*y)/2)^3) if p == 1 (mod 3) where 4*p = x^2 + 3*y^2, |x|<|y| and x == 2 (mod 3). - Jianing Song, Mar 19 2022

Extensions

Corrected by Charles R Greathouse IV, Sep 02 2009

A286354 Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1 - x^j)^k.

Original entry on oeis.org

1, 1, 0, 1, -1, 0, 1, -2, -1, 0, 1, -3, -1, 0, 0, 1, -4, 0, 2, 0, 0, 1, -5, 2, 5, 1, 1, 0, 1, -6, 5, 8, 0, 2, 0, 0, 1, -7, 9, 10, -5, 0, -2, 1, 0, 1, -8, 14, 10, -15, -4, -7, 0, 0, 0, 1, -9, 20, 7, -30, -6, -10, 0, -2, 0, 0, 1, -10, 27, 0, -49, 0, -5, 8, 0, -2, 0, 0, 1, -11, 35, -12, -70, 21, 11, 25, 9, 0, 1, 0, 0
Offset: 0

Views

Author

Ilya Gutkovskiy, May 08 2017

Keywords

Comments

A(n,k) number of partitions of n into an even number of distinct parts minus number of partitions of n into an odd number of distinct parts with k types of each part.

Examples

			A(3,2) = 2 because we have [2, 1], [2', 1], [2, 1'], [2', 1'] (number of partitions of 3 into an even number of distinct parts with 2 types of each part), [3], [3'] (number of partitions of 3 into an odd number of distinct parts with 2 types of each part) and 4 - 2 = 2.
Square array begins:
1,  1,  1,  1,  1,   1,  ...
0, -1, -2, -3, -4,  -5,  ...
0, -1, -1,  0,  2,   5,  ...
0,  0,  2,  5,  8,  10,  ...
0,  0,  1,  0, -5, -15,  ...
0,  1,  2,  0, -4,  -6,  ...
		

Crossrefs

Main diagonal gives A008705.
Antidiagonal sums give A299105.

Programs

  • Maple
    A:= proc(n, k) option remember; `if`(n=0, 1, -k*
          add(numtheory[sigma](j)*A(n-j, k), j=1..n)/n)
        end:
    seq(seq(A(n, d-n), n=0..d), d=0..12);  # Alois P. Heinz, Jun 21 2018
  • Mathematica
    Table[Function[k, SeriesCoefficient[Product[(1 - x^i)^k , {i, Infinity}], {x, 0, n}]][j - n], {j, 0, 12}, {n, 0, j}] // Flatten
    Table[Function[k, SeriesCoefficient[QPochhammer[x, x, Infinity]^k, {x, 0, n}]][j - n], {j, 0, 12}, {n, 0, j}] // Flatten
    Table[Function[k, SeriesCoefficient[Sum[(-1)^i*x^(i*(3*i + 1)/2), {i, -Infinity, Infinity}]^k, {x, 0, n}]][j - n], {j, 0, 12}, {n, 0, j}] // Flatten

Formula

G.f. of column k: Product_{j>=1} (1 - x^j)^k.
G.f. of column k: (Sum_{j=-inf..inf} (-1)^j*x^(j*(3*j+1)/2))^k.
Column k is the Euler transform of period 1 sequence [-k, -k, -k, ...].

A000729 Expansion of Product_{k >= 1} (1 - x^k)^6.

Original entry on oeis.org

1, -6, 9, 10, -30, 0, 11, 42, 0, -70, 18, -54, 49, 90, 0, -22, -60, 0, -110, 0, 81, 180, -78, 0, 130, -198, 0, -182, -30, 90, 121, 84, 0, 0, 210, 0, -252, -102, -270, 170, 0, 0, -69, 330, 0, -38, 420, 0, -190, -390, 0, -108, 0, 0, 0, -300, 99, 442, 210, 0, 418, -294, 0, 0, -510, 378, -540, 138, 0
Offset: 0

Views

Author

Keywords

Comments

This is Glaisher's function lambda(m). It appears to be defined only for odd m, and lambda(4t-1) = 0 (t >= 1), lambda(4t+1) = a(t) (t >= 0). - N. J. A. Sloane, Nov 25 2018
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number 36 of the 74 eta-quotients listed in Table I of Martin (1996).
Dickson, v.2, p. 295 briefly states a result of Glaisher, 1883, pp 212-215. This result is that a(n) is the sum over all solutions of 16*n + 4 = x^2 + y^2 + z^2 + w^2 in nonnegative odd integers of chi(x) and is also the sum over all solutions of 8*n + 2 = x^2 + y^2 in nonnegative odd integers of chi(x) * chi(y) where chi(x) = x if x == 1 (mod 4) and -x if x == 3 (mod 4). [Michael Somos, Jun 18 2012]
Denoted by g_3(q) in Cynk and Hulek on page 8 as the unique weight 3 Hecke eigenform of level 16 with complex multiplication by i. - Michael Somos, Aug 24 2012
This is a member of an infinite family of integer weight modular forms. g_1 = A008441, g_2 = A002171, g_3 = A000729, g_4 = A215601, g_5 = A215472. - Michael Somos, Aug 24 2012

Examples

			G.f. = 1 - 6*x + 9*x^2 + 10*x^3 - 30*x^4 + 11*x^6 + 42*x^7 - 70*x^9 + 18*x^10 + ...
G.f. = q - 6*q^5 + 9*q^9 + 10*q^13 - 30*q^17 + 11*q^25 + 42*q^29 - 70*q^37 + ...
		

References

  • 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. 295, and vol. 3, p. 134.
  • J. W. L. Glaisher, On the representations of a number as a sum of four squares, and on some allied arithmetical functions, Quarterly Journal of Pure and Applied Mathematics, 36 (1905), 305-358. See page 340.
  • J. W. L. Glaisher, The arithmetical functions P(m), Q(m), Omega(m), Quart. J. Math, 37 (1906), 36-48.
  • Morris Newman, A table of the coefficients of the powers of eta(tau). Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216.
  • 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

Powers of Euler's product: A000594, A000727 - A000731, A000735, A000739, A002107, A010815 - A010840.

Programs

  • Magma
    A := Basis( ModularForms( Gamma1(16), 3), 274); A[2] - 6*A[6] + 9*A[10] + 10*A[14] - 30*A[18]; /* Michael Somos, May 17 2015 */
    
  • Magma
    A := Basis( CuspForms( Gamma1(16), 3), 274); A[1] - 6*A[5]; /* Michael Somos, Jan 09 2017 */
  • Mathematica
    a[ n_] := SeriesCoefficient[ 1/16 EllipticTheta[ 4, 0, q] EllipticTheta[ 2, 0, q]^4 EllipticTheta[ 3, 0, q], {q, 0, 4 n + 1}]; (* Michael Somos, Jun 18 2012 *)
    a[ n_] := If[ n < 0, 0, With[ {m = Sqrt[ 16 n + 4]}, SeriesCoefficient[ Sum[ Mod[k, 2] q^k^2, {k, m}]^3 Sum[ KroneckerSymbol[ -4, k] k q^k^2, {k, m}], {q, 0, 16 n + 4}]]]; (* Michael Somos, Jun 12 2012 *)
    a[ n_] := With[ {m = InverseEllipticNomeQ @ q}, SeriesCoefficient[ Sqrt[(1 - m) m ] (EllipticK[m] 2/Pi)^3 / (4 q^(1/2)), {q, 0, 2 n}]]; (* Michael Somos, Jun 22 2012 *)
    a[ n_] := SeriesCoefficient[ Product[ 1 - x^k, {k, n}]^6, {x, 0, n}]; (* Michael Somos, May 17 2015 *)
    a[ n_] := SeriesCoefficient[ QPochhammer[ x]^6, {x, 0, n}]; (* Michael Somos, May 17 2015 *)
    a[ n_] := SeriesCoefficient[ (-1/4) EllipticThetaPrime[ 1, -Pi/4, q] EllipticTheta[ 1, -Pi/4, q]^3, {q, 0, 4 n + 1}]; (* Michael Somos, May 17 2015 *)
    a[ n_] := SeriesCoefficient[ (-1/16) EllipticThetaPrime[ 1, 0, q] EllipticTheta[ 1, -Pi/2, q]^3, {q, 0, 4 n + 1}]; (* Michael Somos, May 17 2015 *)
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A)^6, n))};
    
  • PARI
    {a(n) = my(A, p, e, x, y, a0, a1); if( n<0, 0, n = 4*n + 1; A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k,]; if( p==2, 0, p%4==3, if( e%2, 0, p^e), forstep( i=1, sqrtint(p), 2, if( issquare( p - i^2, &y), x=i; break)); a0=1; a1 = y = 2*(x^2 - y^2); for( i=2, e, x = y*a1 - p^2*a0; a0=a1; a1=x); a1)))}; /* Michael Somos, Aug 21 2006 */
    
  • PARI
    {a(n)=local(tn=(sqrtint(8*n+1)+1)\2);polcoeff(sum(m=0,tn,(1+2*m)^2*x^(m^2+m)+x*O(x^n)) + 2*sum(m=0,tn,sum(k=1,tn,(1+4*(m^2+m-k^2))*x^(m^2+m+k^2)+x*O(x^n))),n)} /* Paul D. Hanna, Mar 15 2010 */
    

Formula

Expansion of q^(-1/4)/16 * theta_2(q)^4 * theta_3(q) * theta_4(q) in powers of q. - [Dickson, v. 3, p. 134] from Stieltjes footnote 160. Michael Somos, Jun 18 2012
Expansion of q^(-1/2) / 4 * k * k' * (K / (pi/2))^3 in powers of q^2 where k, k', K are Jacobi elliptic functions. - Michael Somos, Jun 22 2012
G.f.: Product_{k>0}(1 - x^k)^6.
Given g.f. A(x), then A(q^4) = f(-q^4)^6 = phi(q) * phi(-q) * psi(q^2)^4 where phi(), psi(), f() are Ramanujan theta functions. - Michael Somos, Aug 23 2006
a(n) = b(4*n + 1) where b(n) is multiplicative with b(2^e) = 0^e, b(p^e) = p^e * (1 + (-1)^e) / 2 if p == 3 (mod 4), b(p^e) = b(p) * b(p^(e-1)) - b(p^(e-2)) * p^2 if p == 1 (mod 4) and b(p) = 2 * (x^2 - y^2) where p = x^2 + y^2 and y is even. - Michael Somos, Aug 23 2006
G.f. is a period 1 Fourier series which satisfies f(-1 / (16 t)) = 64 (t/i)^3 f(t) where q = exp(2 Pi i t). - Michael Somos, Aug 24 2012
G.f.: Sum_{k>=0} a(k) * x^(4*k + 1) = (1/2) * Sum_{u,v in Z} (u*u - 4*v*v) * x^(u*u + 4*v*v). - Michael Somos, Jun 14 2007
G.f.: eta(x)^6 = Sum_{n>=0} (1+2n)^2*x^(n^2+n) + 2*Sum_{n>=0,k>=1} (1 + 4(n^2+n-k^2))*x^(n^2+n+k^2) - from the Milne and Leininger reference. [Paul D. Hanna, Mar 15 2010]
a(0) = 1, a(n) = -(6/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 26 2017
G.f.: exp(-6*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
Let M be a positive integer whose prime factors are all congruent to 3 (mod 4) - see A004614. Then a( M^2*n + (M^2 - 1)/4 ) = M^2*a(n). See Cooper et al., equation 5. - Peter Bala, Dec 01 2020
a(n) = b(4*n + 1) where b(n) is multiplicative with b(2^e) = 0^e, b(p^e) = p^e * (1 + (-1)^e) / 2 if p == 3 (mod 4), b(p^e) = ((x+y*i)^(2*e+2) - (x-y*i)^(2*e+2))/((x+y*i)^2 - (x-y*i)^2) if p == 1 (mod 4) where p = x^2 + y^2 and x is odd. - Jianing Song, Mar 19 2022

A187076 Coefficients of L-series for elliptic curve "144a1": y^2 = x^3 - 1.

Original entry on oeis.org

1, 4, 2, -8, -5, 4, -10, -8, 9, 0, 14, 16, -10, 4, 0, 8, 14, -20, 2, 0, -11, -20, -32, 16, 0, 4, 14, -8, -9, -20, 26, 0, 2, 28, 0, 16, 16, 28, -22, 0, 14, -16, 0, -40, 0, 28, 26, -32, -17, 0, -32, 16, -22, 0, -10, -32, -34, 8, 14, 0, 45, 4, 38, -8, 0, 0, -34
Offset: 0

Views

Author

Michael Somos, Mar 05 2011

Keywords

Comments

Number 67 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).

Examples

			G.f. = 1 + 4*x + 2*x^2 - 8*x^3 - 5*x^4 + 4*x^5 - 10*x^6 - 8*x^7 + 9*x^8 + ...
G.f. = q + 4*q^7 + 2*q^13 - 8*q^19 - 5*q^25 + 4*q^31 - 10*q^37 - 8*q^43 + 9*q^49 + ...
		

Crossrefs

Programs

  • Magma
    A := Basis( CuspForms( Gamma0(144), 2), 398); A[1] + 4*A[7] + 2*A[11] - 8*A[13]; /* Michael Somos, Jan 01 2017 */
  • Mathematica
    a[ n_] := SeriesCoefficient[ QPochhammer[ -x]^4, {x, 0, n}]; (* Michael Somos, Jun 10 2015 *)
  • PARI
    {a(n) = if( n<0, 0, ellak( ellinit( [0, 0, 0, 0, -1], 1), 6*n + 1))};
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x^2 + A)^3 / (eta(x + A) * eta(x^4 + A)))^4, n))};
    
  • PARI
    {a(n) = my(m, A, p, e, x, y, a0, a1); if( n<0, 0, m = 6*n + 1; A = factor(m); prod( k=1, matsize(A)[1], [p, e] = A[k,]; if( p<5, 0, p%6==5, if(e%2, 0, (-p)^(e/2)), for( y=1, sqrtint(p\3), if( issquare(p - 3*y^2, &x), break)); a0 = 1; if( x%6>3, x = -x); a1 = x = 2*x; for( i=2, e, y = x*a1 - p*a0; a0 = a1; a1 = y); a1)))};
    

Formula

Expansion of f(x)^4 in powers of x where f() is a Ramanujan theta function.
Expansion of q^(-1/6) * (eta(q^2)^3 / (eta(q) * eta(q^4)))^4 in powers of q.
Euler transform of period 4 sequence [4, -8, 4, -4, ...].
G.f. is a period 1 Fourier series which satisfies f(-1 / (144 t)) = f(t) where q = exp(2 Pi i t).
a(n) = b(6*n + 1) and b(n) is multiplicative with b(2^e) = b(3^e) = 0^e, b(p^e) = b(p) * b(p^(e-1)) - p * b(p^(e-2)), b(p) = 0 if p == 5 (mod 6), b(p) = 2 * x where p = x^2 + 3 * y^2 == 1 (mod 6) and x == 4, 5 (mod 6).
G.f.: Product_{k>0} (1 - (-x)^k)^4. a(n) = (-1)^n * A000727(n).
Convolution cube is A209676. - Michael Somos, Jun 10 2015
a(2*n) = A258779(n). a(2*n + 1) = 4 * A187150(n). - Michael Somos, Jun 10 2015

A168175 Expansion of 1/(1 - 4*x + 7*x^2).

Original entry on oeis.org

1, 4, 9, 8, -31, -180, -503, -752, 513, 7316, 25673, 51480, 26209, -255524, -1205559, -3033568, -3695359, 6453540, 51681673, 161551912, 284435937, 6880364, -1963530103, -7902282960, -17864421119, -16141703756, 60484132809
Offset: 0

Views

Author

Roger L. Bagula, Nov 19 2009

Keywords

Comments

Also the coefficient of i of Q^(n+1), Q being the quaternion 2+i+j+k. The real part of the quaternion power is A213421, see also A087455, A088138, A128018. - Stanislav Sykora, Jun 11 2012
a(n)*(-1)^n gives the coefficient c(7^n) of (eta(z^6))^4, a modular cusp form of weight 2, when expanded in powers of q = exp(2*Pi*i*z), Im(z) > 0, assuming alpha-multiplicativity (but not for primes 2 and 3) with alpha(x) = x (weight 2) and input c(7) = -4. Eta is the Dedekind function. See the Apostol reference, p. 138, eq. (54) for alpha-multiplicativity and p. 130, eq. (39) with k=2. See also A000727(n) = b(n) where c(7^n) = b((7^n-1)/6) = b(A023000(n)), n >= 0. Proof: The alpha-multiplicity with alpha(1) = 1 and c(1) = 1 leads from p^n = p^(n-1)*p to the recurrence c_n = c*c_(n-1) - a*c(n-2), with c_n = c(p^n), c = c(p) and a = alpha(p). Inputs are c_{-1} = 0 and c_0 = c(1) = 1. This gives the polynomial c_n = sqrt(a)^n * S(n,c/sqrt(a)), with Chebyshev's S-polynomials (A049310). See the Apostol reference, Exercise 6., p. 139. Here p = 7, c = -4. - Wolfdieter Lang, Apr 27 2016

Examples

			G.f. = 1 + 4*x + 9*x^2 + 8*x^3 - 31*x^4 - 180*x^5 - 503*x^6 - 752*x^7 + ... - _Michael Somos_, Feb 23 2020
		

References

  • Tom M. Apostol, Modular Functions and Dirichlet Series in Number Theory, Second edition, Springer, 1990, pp. 130, 138 - 139.

Crossrefs

Programs

  • Magma
    I:=[1,4]; [n le 2 select I[n] else 4*Self(n-1)-7*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Jun 25 2012
    
  • Mathematica
    CoefficientList[Series[1/(1-4x+7x^2),{x,0,30}],x] (* or *) LinearRecurrence[ {4,-7},{1,4},30] (* Harvey P. Dale, Nov 28 2014 *)
  • PARI
    {a(n) = my(s=1, t=1); if( n<0, n=-2-n; s=-1; t=1/7); s * t^(n+1) * polcoeff(1 / (1 - 4*x + 7*x^2) + x * O(x^n), n)}; /* Michael Somos, Feb 23 2020 */

Formula

a(n) = (1/2 - i/sqrt(3))*(2 + i*sqrt(3))^n + (1/2 + i/sqrt(3))*(2 - i*sqrt(3))^n (Binet formula), where i is the imaginary unit.
a(n) = 4*a(n-1) - 7*a(n-2).
a(n) = sqrt(7)^n * S(n, 4/sqrt(7)), n >= 0, with Chebyshev's S polynomials (A049310). - Wolfdieter Lang, Apr 27 2016
E.g.f.: (2*sqrt(3)*sin(sqrt(3)*x) + 3*cos(sqrt(3)*x))*exp(2*x)/3. - Ilya Gutkovskiy, Apr 27 2016
a(n) = (-1) * 7^(n+1) * a(-2-n) for all n in Z. - Michael Somos, Feb 23 2020

A302056 Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1 - x^j)^4 is zero.

Original entry on oeis.org

9, 14, 19, 24, 31, 34, 39, 42, 44, 49, 53, 59, 64, 65, 69, 74, 75, 82, 84, 86, 89, 94, 97, 99, 108, 109, 111, 114, 116, 119, 124, 130, 133, 134, 139, 144, 149, 150, 152, 157, 159, 163, 164, 167, 169, 174, 180, 184, 185, 189, 194, 196, 198, 199, 201, 203, 207, 209
Offset: 1

Views

Author

Ilya Gutkovskiy, Mar 31 2018

Keywords

Comments

Numbers k such that number of partitions of k into an even number of distinct parts equals number of partitions of k into an odd number of distinct parts, with 4 types of each part.
From Jianing Song, Feb 09 2021: (Start)
The following are equivalent:
- k is in this sequence;
- At least one prime congruent to 5 modulo 6 divides 6*k+1 with an odd exponent;
- 6*k+1 is not of the form x^2 + x*y + y^2, i.e., 6*k+1 is in A034020. (End)

Crossrefs

Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1 - x^j)^m is zero: A090864 (m = 1), A213250 (m = 2), A014132 (m = 3), this sequence (m = 4), A302057 (m = 5), A020757 (m = 6), A322430 (m = 8), A322431 (m = 10), A322432 (m = 14), A322043 (m = 15), A322433 (m = 26).

Programs

  • Mathematica
    Flatten[Position[nmax = 210; Rest[CoefficientList[Series[QPochhammer[x]^4, {x, 0, nmax}], x]], 0]]
    Flatten[Position[nmax = 210; Rest[CoefficientList[Series[Sum[(-1)^j x^(j (3 j + 1)/2), {j, -nmax, nmax}]^4, {x, 0, nmax}], x]], 0]]
    Flatten[Position[nmax = 210; Rest[CoefficientList[Series[Exp[-4 Sum[DivisorSigma[1, j] x^j/j, {j, 1, nmax}]], {x, 0, nmax}], x]], 0]]
  • PARI
    x='x+O('x^999); v=Vec(eta(x)^4 - 1); for(k=1, #v, if(v[k]==0, print1(k, ", "))); \\ Altug Alkan, Mar 31 2018, after Joerg Arndt at A213250

A000728 Expansion of Product_{n>=1} (1-x^n)^5.

Original entry on oeis.org

1, -5, 5, 10, -15, -6, -5, 25, 15, -20, 9, -45, -5, 25, 20, 10, 15, 20, -50, -35, -30, 55, -50, 15, 80, 1, 50, -35, -45, -15, 5, -50, -25, -55, 85, 51, 50, 10, -40, 65, 10, -10, -115, 50, -115, -100, 85, 80, -30, 5, 20, 45, 70, 65, 45, -55, -100
Offset: 0

Views

Author

Keywords

References

  • Newman, Morris; A table of the coefficients of the powers of eta(tau). Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216.
  • 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

Cf. A258405.

Programs

Formula

a(0) = 1, a(n) = -(5/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 26 2017
G.f.: exp(-5*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018

A339703 Dirichlet g.f.: Product_{k>=2} (1 - k^(-s))^4.

Original entry on oeis.org

1, -4, -4, 2, -4, 12, -4, 8, 2, 12, -4, 4, -4, 12, 12, -5, -4, 4, -4, 4, 12, 12, -4, -28, 2, 12, 8, 4, -4, -20, -4, -4, 12, 12, 12, -26, -4, 12, 12, -28, -4, -20, -4, 4, 4, 12, -4, -8, 2, 4, 12, 4, -4, -28, 12, -28, 12, 12, -4, -44, -4, 12, 4, -10, 12, -20, -4, 4, 12, -20
Offset: 1

Views

Author

Ilya Gutkovskiy, Dec 13 2020

Keywords

Crossrefs

Formula

a(1) = 1; a(n) = -Sum_{d|n, d < n} A339319(n/d) * a(d).
a(p^k) = A000727(k) for prime p.

A010818 Expansion of Product (1 - x^k)^10 in powers of x.

Original entry on oeis.org

1, -10, 35, -30, -105, 238, 0, -260, -165, 140, 1054, -770, -595, 0, -715, 2162, 455, 0, -2380, -1820, 2401, -680, 1495, 3080, 1615, -6958, -1925, 0, 0, 5100, -1442, 8330, -5355, 1330, 0, -16790, 0, 8190, 8265, 0, 1918, 0, 8415, -10230, -7140, -9362
Offset: 0

Views

Author

Keywords

Examples

			G.f. = 1 - 10*x + 35*x^2 - 30*x^3 - 105*x^4 + 238*x^5 - 260*x^7 - 165*x^8 + ...
G.f. = q^5 - 10*q^17 + 35*q^29 - 30*q^41 - 105*q^53 + 238*q^65 - 260*q^89 + ...
		

References

  • Newman, Morris; A table of the coefficients of the powers of eta(tau). Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216.

Crossrefs

Powers of Euler's product: A000594, A000727 - A000731, A000735, A000739, A002107, A010815 - A010840.

Programs

  • Mathematica
    a[ n_] := SeriesCoefficient[ QPochhammer[ x]^10, {x, 0, n}]; (* Michael Somos, Jun 24 2013 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( eta(x + x * O(x^n))^10, n))}; /* Michael Somos, Jun 09 2011 */
    
  • PARI
    {a(n) = local(m, x, y, z); if( n<0, 0, m = 12*n + 5; z = 0; for( x = -sqrtint(m), sqrtint(m), if( x%6 != 1, next); if( issquare( m - x^2, &y), if( y%6 == 2, y = -y); if( y%6 == 4, z += x*y * (x*x - y*y) ))); z / 6)}; /* Michael Somos, Jun 09 2011 */
    
  • PARI
    {a(n) = local(A, p, e, i, x, y, a0, a1); if( n<0, 0, n = 12*n + 5; A = factor(n); 1 / 48 * prod( k=1, matsize(A)[1], if( p=A[k,1], e=A[k,2]; if( p<5, 0, if( p%12 > 6, if( e%2, 0, p^(2*e)), forstep( i = 1, sqrtint( p), 2, if( issquare( p - i^2, &y), x=i; break)); if( p%12 == 5, a1 = 8 * x*y * (x-y) * (x+y) * (-1)^((x%6==1) + (y%6==4)), a1 = 2 * (x^2-y^2+2*x*y) * (x^2-y^2-2*x*y) * (-1)^(x%6==3) ); a0 = 1; y = a1; for( i=2, e, x = y * a1 - p^4 * a0; a0=a1; a1=x); a1 )))))}; /* Michael Somos, Jun 24 2013 */

Formula

Expansion of f(-x)^10 in powers of x where f() is a Ramanujan theta function.
Expansion of q^(-5/12) * eta(q)^10 in powers of q. - Michael Somos, Jun 09 2011
a(n) = b(12*n + 5) / 48 where b() is multiplicative with b(2^e) = b(3^e) = 0^e, b(p^e) = (1 + (-1)^e) / 2 * p^(2*e) if p == 7 or 11 (mod 12), b(p^e) = b(p) * b(p^(e-1)) - p^4 * b(p^(e-2)) if p == 1 or 5 (mod 12). - Michael Somos, Jun 24 2013
G.f. is a period 1 Fourier series which satisfies f(-1 / (144 t)) = 12^5 (t/i)^5 f(t) where q = exp(2 Pi i t). - Michael Somos, Jan 06 2014
G.f.: Product_{k>0} (1 - x^k)^10. a(49*n + 20) = 2401 * a(n).
48 * a(n) = A234565(3*n + 1). a(7*n + 2) = 0 unless n == 2 (mod 7). - Michael Somos, Jul 18 2014
a(0) = 1, a(n) = -(10/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 27 2017
G.f.: exp(-10*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
Let M = p_1*...*p_k be a positive integer whose prime factors p_i (not necessarily distinct) are congruent to 7 (mod 12) or 11 (mod 12). Then a( M^2*n + 10*(M^2 - 1)/24 ) = M^4*a(n). See Cooper et al., Theorem 1. - Peter Bala, Dec 01 2020
Showing 1-10 of 26 results. Next