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 A309071 #31 Dec 28 2021 23:10:44 %S A309071 0,4,5,720 %N A309071 Complete list of solutions to y^2 = x^3 + 20*x; sequence gives x values. %C A309071 (x,y) = (0,0) is this solution. Consider x > 0. If x is square, x^2 + 20 is square and we get (x,y) = (4,12). If x is not square, x = i^2*j where j is squarefree. j | x^2 + 20, so j is 2,5 or 10. If j = 2 or 10, there is no such (x,y). If j = 5, (y/5)^2 = i^2*(5*i^4 + 4). So 5*i^4 + 4 = k^2. That is k^2 - 5*i^4 = 4. i^2 is a square Fibonacci number. i^2 = 1 or 144, so x = 5 or 720. %e A309071 0^3 + 20* 0 = 0 = 0^2. %e A309071 4^3 + 20* 4 = 144 = 12^2. %e A309071 5^3 + 20* 5 = 225 = 15^2. %e A309071 720^3 + 20*720 = 373262400 = 19320^2. %o A309071 (PARI) for(k=0, 1e5, if(issquare(k*(k^2+20)), print1(k", "))) %o A309071 (SageMath) [i[0] for i in EllipticCurve([20, 0]).integral_points()] # _Seiichi Manyama_, Aug 25 2019 %Y A309071 Cf. A029728, A116108, A126203. %K A309071 nonn,fini,full %O A309071 1,2 %A A309071 _Seiichi Manyama_, Jul 10 2019