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.
%I A356731 #11 Aug 25 2022 09:54:39 %S A356731 144,1728,972,432,10800,15552,5292,576,3888,14400,13068,972,73008, %T A356731 84672,24300,432,41616,15552,12996,10800,190512,209088,57132,15552, %U A356731 10800,97344,36,1764,363312,388800,103788,1728,470448,499392,44100,3888,197136,623808,164268,43200,726192 %N A356731 Conductor of the elliptic curve y^2 = x^3 - n. %C A356731 The discriminant of the elliptic curve y^2 = x^3 - n is -432*n^2 and the rank is A060951(n). %C A356731 a(n*t^6) = a(n) for all t since the elliptic curve y^2 = x^3 - n*t^6 can be written as (y/t^3)^2 = (x/t^2)^3 - n, and the conductor is an invariant of elliptic curves. %C A356731 Conjectures: (Start) %C A356731 (i) a(27*n) = A356730(n) for all n. %C A356731 (ii) a(n) is divisible by 36, and a(n) = 36 <=> n is 27 times a sixth power, a(n) = 108 <=> n is 108 times a sixth power, a(n) = 144 <=> n is a sixth power; moreover, it seems that a(n) is divisible by 36*n^2 if n is squarefree. (End) %H A356731 Jianing Song, <a href="/A356731/b356731.txt">Table of n, a(n) for n = 1..10000</a> %H A356731 LMFDB, <a href="https://www.lmfdb.org/EllipticCurve/Q/">Elliptic Curves Over Q</a> %o A356731 (PARI) a(n) = ellglobalred(ellinit([0,0,0,0,-n]))[1] %Y A356731 Cf. A356730, A060951. %K A356731 nonn %O A356731 1,1 %A A356731 _Jianing Song_, Aug 24 2022