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.
Sort([ p[1] : p in IntegralPoints(EllipticCurve([0, 113])) ]); /* adapted from A029728 */
[i[0] for i in EllipticCurve([0, 113]).integral_points()] # Seiichi Manyama, Aug 25 2019
a(1)^2 = 7^2 = 49 = A134042(1)^3 + 113 = -64 + 113. a(2)^2 = 11^2 = 121 = A134042(2)^3 + 113 = 8 + 113. a(3)^2 = 25^2 = 625 = A134042(3)^3 + 113 = 512 + 113. a(4)^2 = 38^2 = 1444 = A134042(4)^3 + 113 = 1331+ 113. a(5)^2 = 133^2 = 17689 = A134042(5)^3 + 113 = 17576 + 113. a(6)^2 = 8669^2 = 75151561 = A134042(6)^3 + 113 = 75151448 + 113.
Sort([ Abs(p[2]) : p in IntegralPoints(EllipticCurve([0, 113])) ]); /* adapted from A029727 */
(Program does not produce first two terms) a = {}; Do[k = n^2 - (Floor[n^(2/3)])^3; If[(k > 112) && (k < 113), AppendTo[a, n]], {n, 1, 100000}]; a
diop(n,m) = {f=0; for(p=1,m, f=0; for(x=1,n, y=x*x*x+p; if(issquare(y),f=1); ); if(f==0,print1(p" ")) ) }
Comments