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.

A372543 Least k such that the rank of the elliptic curve y^2 = x^3 - k^2*x + 1 is n, or -1 if no such k exists.

This page as a plain text file.
%I A372543 #89 Aug 16 2024 21:03:22
%S A372543 0,1,2,4,8,17,61,347,3778,11416
%N A372543 Least k such that the rank of the elliptic curve y^2 = x^3 - k^2*x + 1 is n, or -1 if no such k exists.
%C A372543 This family of curves quickly reaches a moderate value of rank with a relatively small parameter k.
%C A372543 By heuristic search (see links), a(10) <= 216493 and a(11) <= 1448203.
%H A372543 Anna Antoniewicz, <a href="http://www.emis.de/journals/UIAM/PDF/43-21-32.pdf">On a family of elliptic curves</a>, (2005) Iagellonicae Acta Mathematica, XLIII.
%H A372543 Jose Aranda, <a href="/A372543/a372543.txt">Non sequential search for upper bounds</a> (PARI-GP Script)
%H A372543 Cecylia Bocovich, <a href="https://digitalcommons.macalester.edu/mathcs_honors/24">Elliptic Curves of High Rank</a>, (2012) Macalester College, Science Honors Projects.
%o A372543 (PARI) a(n,startAt=0)=for(k=startAt, oo, my(t=ellrank(ellinit([-k^2, +1]))); if(t[2]<n, next); if(t[1]>n, warning("k=",k," has rank in ",t[1..2]); next); if(t[1]<n || t[2]>n, error("Cannot determine if a(",n,") is ",k," or larger; rank is in ",t[1..2])); return(k)) \\ _Charles R Greathouse IV_, Jul 08 2024
%o A372543 (PARI) \\ See Aranda link.
%Y A372543 Cf. A194687, A309060, A309068, A309069, A309146, A309147, A309164, A309165.
%K A372543 nonn,hard,more
%O A372543 0,3
%A A372543 _Jose Aranda_, Jul 04 2024