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.

A029937 Genus of modular curve X_1(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 1, 1, 2, 5, 2, 7, 3, 5, 6, 12, 5, 12, 10, 13, 10, 22, 9, 26, 17, 21, 21, 25, 17, 40, 28, 33, 25, 51, 25, 57, 36, 41, 45, 70, 37, 69, 48, 65, 55, 92, 52, 81, 61, 85, 78, 117, 57, 126, 91, 97
Offset: 1

Views

Author

Keywords

Comments

Also the dimension of the space of cusp forms of weight two on Gamma1(n). [Steven Finch, Apr 03 2009]

References

  • F. Hirzebruch et al., Manifolds and Modular Forms, Vieweg, 2nd ed. 1994, p. 161.

Crossrefs

Cf. A001617, A029938. [Steven Finch, Apr 03 2009]

Programs

  • Maple
    with(numtheory); A029937 := proc(n) local i,j; j := 1+(1/24)*phi(n)*A001615(n); for i in divisors(n) do j := j-(1/4)*phi(i)*phi(n/i) od; j; end;
  • Mathematica
    a[n_ /; n<5] = 0; a[n_] := 1+Sum[d^2*MoebiusMu[n/d]/24 - EulerPhi[d]*EulerPhi[n/d]/4, {d, Divisors[n]}]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Jan 13 2014 *)
  • PARI
    A029935(n) = {
      my(f = factor(n), fsz = matsize(f)[1],
         g = prod(k=1, fsz, f[k,1]),
         h = prod(k=1, fsz, sqr(f[k,1]-1)*f[k,2] + sqr(f[k,1])-1));
      return(h*n\sqr(g));
    };
    a(n) = {
      if (n < 5, return(0));
      my(f = factor(n), fsz = matsize(f)[1],
         g = prod(k=1, fsz, f[k,1]),
         h = prod(k=1, fsz, sqr(f[k,1]) - 1));
      return(1 + sqr(n\g)*h/24 - A029935(n)/4);
    };
    vector(63, n, a(n))  \\ Gheorghe Coserea, Oct 23 2016

Formula

a(n) = 1 + A115000(n) - A029935(n)/4, n > 4. [Kim and Koo, Theorem 1]

A159046 Dimension of the space of newforms of weight 2 on the subgroup Gamma_1(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 1, 1, 2, 5, 2, 7, 3, 5, 4, 12, 5, 12, 6, 13, 8, 22, 7, 26, 13, 19, 11, 25, 13, 40, 14, 29, 19, 51, 13, 57, 25, 39, 21, 70, 23, 69, 24, 55, 37, 92, 22, 79, 42, 71, 34, 117, 34, 126, 39, 87, 61, 117, 31, 155, 68, 109, 45, 176, 55, 187, 56, 119, 87
Offset: 1

Views

Author

Steven Finch, Apr 03 2009

Keywords

Examples

			a(p) = A029937(p) = (p-5)*(p-7)/24 for any prime p>3.
G.f. = x^11 + 2*x^13 + x^14 + x^15 + 2*x^16 + 5*x^17 + 2*x^18 + 7*x^19 + ...
		

Crossrefs

Programs

  • Mathematica
    a[ n_] := If[ n < 1, 0, Sum[ DivisorSum[ n/j, MoebiusMu[#] MoebiusMu[n/j/#] &] If[ j < 5, 0, 1 + DivisorSum[ j, #^2 MoebiusMu[ j/#] / 24 - EulerPhi [#] EulerPhi[j/#] / 4 &]], {j, Divisors@n}]]; (* Michael Somos, May 10 2015 *)
  • PARI
    {a(n) = if( n<1, 0, sumdiv(n, j, sumdiv(n/j, k, moebius(k) * moebius(n/j/k)) * if( j<5, 0, 1 + sumdiv(j, k, k^2 * moebius(j/k) / 24 - eulerphi(k) * eulerphi(j/k) / 4))))}; /* Michael Somos, May 10 2015 */

Formula

a(n) = A029937(n) - sum a(m)*d(n/m), where the summation is over all divisors 1 < m < n of n and d is the divisor function.
Dirichlet convolution of A007247 and A029937. - Michael Somos, May 10 2015
Showing 1-2 of 2 results.