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.

A093829 Expansion of q * psi(q^3)^3 / psi(q) in powers of q where psi() is a Ramanujan theta function.

Original entry on oeis.org

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

Views

Author

Michael Somos, Apr 17 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. = q - q^2 + q^3 + q^4 - q^6 + 2*q^7 - q^8 + q^9 + q^12 + 2*q^13 + ...
		

Crossrefs

Programs

  • Magma
    Basis( ModularForms( Gamma1(6), 1), 90) [2]; /* Michael Somos, Jul 02 2014 */
  • Mathematica
    a[ n_] := If[ n < 1, 0, DivisorSum[ n, {1, -2, 0, 2, -1, 0} [[ Mod[#, 6, 1]]] &]];
    QP = QPochhammer; s = (QP[q]*QP[q^6]^6)/(QP[q^2]^2*QP[q^3]^3) + O[q]^105; CoefficientList[s, q] (* Jean-François Alcover, Nov 30 2015, adapted from PARI *)
  • PARI
    {a(n) = if( n<1, 0, polcoeff( sum( k=0, n, x^k * (1 - x^k)^2 / (1 + x^(2*k) + x^(4*k)), x * O(x^n)), n))};
    
  • PARI
    {a(n) = local(A); if( n<1, 0, n--; A = x * O(x^n); polcoeff( eta(x + A) * eta(x^6 + A)^6 / (eta(x^2 + A)^2 * eta(x^3 + A)^3), n))};
    
  • PARI
    {a(n) = if( n<1, 0, sumdiv( n, d, kronecker( -12, d) - if( d%2==0, 2 * kronecker( -3, d/2) ) ))}; /* Michael Somos, May 29 2005 */
    
  • Sage
    ModularForms( Gamma1(6), 1, prec=90).1; # Michael Somos, Sep 27 2013
    

Formula

Expansion of (a(q) - a(q^2)) / 6 = c(q^2)^2 / (3 * c(q)) in powers of q where a(), c() are cubic AGM functions. - Michael Somos, Sep 06 2007
Expansion of (eta(q) * eta(q^6)^6) / (eta(q^2)^2 * eta(q^3)^3) in powers of q.
Euler transform of period 6 sequence [ -1, 1, 2, 1, -1, -2, ...].
Moebius transform is period 6 sequence [ 1, -2, 0, 2, -1, 0, ...] = A112300. - Michael Somos, Jul 16 2006
Multiplicative with a(p^e) = (-1)^e if p=2; a(p^e) = 1 if p=3; a(p^e) = 1+e if p == 1 (mod 6); a(p^e) = (1 + (-1)^e) / 2 if p == 5 (mod 6).
G.f. is a period 1 Fourier series which satisfies f(-1 / (6 t)) = 12^(-1/2) (t/i) g(t) where q = exp(2 Pi i t) and g() is g.f. for A122859.
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = w * (u + v)^2 - v * (v + w) * (v + 4*w).
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u2 * (u2 - u3 - 4*u6) - (u3 + u6) * (u1 - 3*u3 - 3*u6).
G.f.: Sum_{k>0} (x^k - 2 * x^(2*k) + 2 * x^(4*k) - x^(5*k)) / (1 - x^(6*k)) = x * Product_{k>0} ((1 - x^k) * (1 - x^(6*k))^6) / ((1 - x^(2*k))^2 * (1 - x^(3*k))^3).
a(n) = -(-1)^n * A113447(n). - Michael Somos, Jan 31 2015
a(2*n) = -a(n). a(3*n) = a(n). a(6*n + 5) = 0.
A035178(n) = |a(n)|. A033762(n) = a(2*n + 1). A033687(n) = a(3*n + 1).
a(4*n + 1) = A112604(n). a(4*n + 3) = A112605(n). a(6*n + 1) = A097195(n). a(8*n + 1) = A112606(n). a(8*n + 3) = A112608(n). a(8*n + 5) = 2 * A112607(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/(6*sqrt(3)) = 0.302299894039... . - Amiram Eldar, Nov 21 2023

A193680 Period 6 sequence 0,1,2,0,2,1.

Original entry on oeis.org

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

Views

Author

Wolfdieter Lang, Sep 30 2011

Keywords

Comments

This sequence can be extended periodically to negative values of n.
See a comment on A203571 where a k-family of 2k-periodic sequences P_k has been defined. The present sequence is P_3. - Wolfdieter Lang, Feb 02 2012

Examples

			a(8) = 8(mod 3) = 2 because (-1)^floor(8/3)= +1; 8\3 = 2 is even.
a(4) = (3-4)(mod 3) = 2, because (-1)^floor(4/3) is -1; 4\3 = 1 is odd.
		

Crossrefs

Cf. signed versions A112300, A186809.

Programs

Formula

a(n) = n (mod 3) if (-1)^floor(n/3)=+1 else (3 - n)(mod 3), n>=0. (-1)^floor(n/3) is the parity of the quotient floor(n/3), sometimes denoted by n\3.
O.g.f.: x*(1+2*x+2*x^3+x^4)/(1-x^6).
a(n) = 1-((-1)^(n+1)+cos(Pi*n/3)+3*cos(2*Pi*n/3))/3. - R. J. Mathar, Oct 07 2011, corrected by Vaclav Kotesovec, Feb 19 2023
a(n) = floor((71/364)*3^(n+1)) mod 3. - Hieronymus Fischer, Jan 04 2013
a(n) = floor((4007/333333)*10^(n+1)) mod 10. - Hieronymus Fischer, Jan 04 2013
From Amiram Eldar, Jan 01 2023: (Start)
Multiplicative with a(2^e) = 2, a(3^e) = 0, and a(p^e) = 1 for p >= 5.
Dirichlet g.f.: zeta(s)*(1+1/2^s-1/3^s-1/6^s). (End)

Extensions

Keyword:mult added by Andrew Howroyd, Jul 31 2018
Showing 1-2 of 2 results.