login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A363793 Number of Q-isomorphism classes of elliptic curves E/Q with good reduction away from prime(n). 0
24, 8, 0, 4, 12, 0, 8, 8, 0, 0, 0, 16, 0, 6, 2, 2, 0, 2, 4, 0, 4, 4, 2, 6, 0, 2, 0, 0, 2, 4, 0, 2, 0, 2, 0, 0, 2, 4, 0, 0, 4, 0, 2, 0, 2, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 0, 2, 0, 4, 0, 0, 0, 10, 0, 0, 0, 2, 0, 2, 0, 4, 6, 0, 2, 0, 0, 2, 4, 0, 0, 0, 0, 6, 4, 0, 8, 0, 0, 0, 0, 2, 0, 0, 0, 0, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
R. von Känel and B. Matschke conjecture that a(n) <= 24 for all n.
LINKS
M. A. Bennett and A. Rechnitzer, Computing elliptic curves over Q: bad reduction at one prime, In: Melnik, R., Makarov, R., Belair, J. (eds) Recent Progress and Modern Challenges in Applied Mathematics, Modeling and Computational Science. Fields Institute Communications, vol 79. Springer, New York, NY.
B. Edixhoven, A. de Groot, and J. Top, Elliptic curves over the rationals with bad reduction at only one prime, Math. Comp. 54 (1990), no.189, 413-419.
A. P. Ogg, Abelian curves of 2-power conductor, Proc. Cambridge Philos. Soc. 62 (1966), 143-148.
B. Setzer, Elliptic curves of prime conductor, J. London Math. Soc. (2)10(1975), 367-378.
FORMULA
a(n) = A110620(prime(n)) + A110620(prime(n)^2) for all n > 2.
EXAMPLE
For n = 1, there are a(1) = 24 elliptic curves over Q with good reduction outside 2, classified by Ogg (1966), with j-invariants given in A332545.
For n = 2, there are a(2) = 8 elliptic curves over Q with good reduction outside 3. A set of 8 Weierstrass equations for these curves can be given as: y^2 + y = x^3 - 270x - 1708, y^2 + y = x^3 - 30x + 63, y^2 + y = x^3 - 7, y^2 + y = x^3, y^2 + y = x^3 - 1, y^2 + y = x^3 + 20, y^2 + y = x^3 - 61, and y^2 + y = x^3 + 2.
For n = 3, Edixhoven-Groot-Top proved there are no elliptic curves over Q with good reduction away from 5, so a(3) = 0.
PROG
(Sage)
def a(n):
EC = EllipticCurves_with_good_reduction_outside_S([Primes()[n-1]])
return len(EC)
CROSSREFS
Sequence in context: A297983 A298632 A241362 * A033823 A040557 A040556
KEYWORD
nonn
AUTHOR
Robin Visser, Jun 22 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 22:01 EST 2023. Contains 367540 sequences. (Running on oeis4.)