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-2 of 2 results.

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

N. J. A. Sloane

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

Links

Crossrefs

Cf. A002654, A008441, A008442, A035154, A035181, A035184, A112301, A113406.
Cf. A113652, A116604, A121363, A121450, A122856, A122864, A122865, A125061.
Cf. A125079, A129447, A129448, A132004, A134013, A134015, A138741, A138746.
Cf. A138950, A138952, A163746, A258210, A258228, A258256, A258279, A258292.

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).
a(n) = A(12*n+1) where A = A002654, A008442, A035154, A035181, A035184, A112301, A113406, A113652, A121450, A122864, A125061, A129448, A132004, A134013, A134015, A138746, A138950, A138952, A163746. (End)
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

A132003 Expansion of (phi(q^3) / phi(q)) * phi(-q^2) * phi(-q^6) in powers of q where phi() is a Ramanujan theta function.

Original entry on oeis.org

1, -2, 2, -2, 2, -4, 2, 0, 2, -2, 4, 0, 2, -4, 0, -4, 2, -4, 2, 0, 4, 0, 0, 0, 2, -6, 4, -2, 0, -4, 4, 0, 2, 0, 4, 0, 2, -4, 0, -4, 4, -4, 0, 0, 0, -4, 0, 0, 2, -2, 6, -4, 4, -4, 2, 0, 0, 0, 4, 0, 4, -4, 0, 0, 2, -8, 0, 0, 4, 0, 0, 0, 2, -4, 4, -6, 0, 0, 4, 0
Offset: 0

Views

Author

Michael Somos, Aug 06 2007

Keywords

Comments

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

Examples

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

References

  • N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 85, Equation (32.72).

Links

Crossrefs

Cf. A008441, A122857, A125079, A132004.

Programs

  • Mathematica
    a[ n_] := If[ n < 1, Boole[n == 0], -2 DivisorSum[ n, (-1)^(n + #) KroneckerSymbol[ -36, #] &]]; (* Michael Somos, Nov 01 2015 *)
a[ n_] := If[ n < 1, Boole[n == 0], -2 Times @@ (Which[ # < 5, -(-1)^#, Mod[#, 4] == 3, 1 - Mod[#2, 2], True, #2 + 1] & @@@ FactorInteger @ n)]; (* Michael Somos, Nov 01 2015 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, q^3] EllipticTheta[ 4, 0, q^2] EllipticTheta[ 4, 0, q^6] / EllipticTheta[ 3, 0, q], {q, 0, n}]; (* Michael Somos, Nov 01 2015 *)
a[ n_] := SeriesCoefficient[ (EllipticTheta[ 4, 0, q]^2 + EllipticTheta[ 4, 0, q^3]^2) / 2, {q, 0, n}]; (* Michael Somos, Mar 05 2023 *)
  • PARI
    {a(n) = if( n<1, n==0, -2 * sumdiv(n, d, (-1)^(n+d) * kronecker(-36, d)))};
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A)^2 * eta(x^4 + A) * eta(x^6 + A)^7 / (eta(x^2 + A)^3 * eta(x^3 + A)^2 * eta(x^12 + A)^3), n))};
  • PARI
    {a(n) = my(A, p, e); if( n<1, n==0, A = factor(n); -2 * prod(k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==3, 1, p==2, -1, p%4==1, e+1, 1-e%2)))};

Formula

Expansion of eta(q)^2 * eta(q^4) * eta(q^6)^7 / (eta(q^2)^3 * eta(q^3)^2 * eta(q^12)^3) in powers of q.
a(n) = -2*b(n) where b() is multiplicative with b(2^e) = 2*0^e - 1, b(3^e) = 1, b(p^e) = e+1 if p == 1 (mod 4), b(p^e) = (1 + (-1)^e)/2 if p == 3 (mod 4).
Euler transform of period 12 sequence [-2, 1, 0, 0, -2, -4, -2, 0, 0, 1, -2, -2, ...].
G.f.: 1 - 2 * Sum_{k>0} Kronecker(-36, k) * x^k / (1 + x^k).
a(n) = - A132004(n) unless n=0.
a(2*n) = A122857(n). a(2*n + 1) = -2 * A125079(n). a(3*n) = a(n). a(3*n + 1) = -2 * A258277(n). a(3*n + 2) = 2 * A258278(n). - Michael Somos, Nov 01 2015
a(12*n + 7) = a(12*n + 11) = 0. a(4*n + 1) = -2 * A008441(n).
a(n) = (-1)^n * A122857(n). Expansion of (phi(-q)^2 + phi(-q^3)^2) / 2 in powers of q where phi() is a Ramanujan theta function. - Michael Somos, Mar 05 2023
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.