OFFSET
1,44
COMMENTS
"A quantity that controls the relation between the modular degree and congruences (the "congruence modulus"). This results in the following table, which suggests that if p | a(n) is a prime, then p^2 | 4 * n,a fact closely related to what Ken Ribet proved at the Raynaud birthday conference in Orsay a few years ago. Also, Mazur proved that a(p) = 1 when p is prime."
LINKS
Jason Kimberley, Table of n, a(n) for n = 1..209
Yuri I. Manin, Iterated Modular Symbols.
William Stein, Modular Symbols, Modular Forms and Modular Abelian Varieties in MAGMA. See table p. 54.
PROG
(Magma) function f(N) J := JZero(N); T := HeckeAlgebra(J); return Index(Saturation(T), T); end function; for N in [1..120] do print N, f(N); end for;
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Feb 16 2008
EXTENSIONS
Terms a(106)..a(167) from Klaus Brockhaus, Feb 19 2008
Terms a(168)..a(209) from Jason Kimberley, Oct 07 2012
STATUS
approved