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 A356730 #11 Aug 25 2022 09:54:35 %S A356730 36,1728,3888,108,2700,15552,21168,576,972,14400,52272,3888,18252, %T A356730 84672,97200,27,10404,15552,51984,2700,47628,209088,228528,15552,2700, %U A356730 97344,144,7056,90828,388800,415152,1728,117612,499392,176400,972,49284,623808,657072,43200,181548 %N A356730 Conductor of the elliptic curve y^2 = x^3 + n. %C A356730 The discriminant of the elliptic curve y^2 = x^3 - n is -432*n^2 and the rank is A060950(n). %C A356730 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 A356730 Conjectures: (Start) %C A356730 (i) a(27*n) = A356731(n) for all n. %C A356730 (ii) a(n) is divisible by 36, and a(n) = 36 <=> n is a sixth power, a(n) = 108 <=> n is 4 times a sixth power, a(n) = 144 <=> n is 27 times a sixth power; moreover, it seems that a(n) is divisible by 36*n^2 if n is squarefree. (End) %H A356730 Jianing Song, <a href="/A356730/b356730.txt">Table of n, a(n) for n = 1..10000</a> %H A356730 LMFDB, <a href="https://www.lmfdb.org/EllipticCurve/Q/">Elliptic Curves Over Q</a> %o A356730 (PARI) a(n) = ellglobalred(ellinit([0,0,0,0,n]))[1] %Y A356730 Cf. A356731, A060950. %K A356730 nonn %O A356730 1,1 %A A356730 _Jianing Song_, Aug 24 2022