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.

A363793 Number of Q-isomorphism classes of elliptic curves E/Q with good reduction away from prime(n).

Original entry on oeis.org

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
Offset: 1

Views

Author

Robin Visser, Jun 22 2023

Keywords

Comments

R. von Känel and B. Matschke conjecture that a(n) <= 24 for all n.

Examples

			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.
		

Crossrefs

Programs

  • Sage
    def a(n):
        EC = EllipticCurves_with_good_reduction_outside_S([Primes()[n-1]])
        return len(EC)

Formula

a(n) = A110620(prime(n)) + A110620(prime(n)^2) for all n > 2.