A081119 -id:A081119 - cp's OEIS frontend

A054504 Numbers n such that Mordell's equation y^2 = x^3 + n has no integral solutions.

6, 7, 11, 13, 14, 20, 21, 23, 29, 32, 34, 39, 42, 45, 46, 47, 51, 53, 58, 59, 60, 61, 62, 66, 67, 69, 70, 74, 75, 77, 78, 83, 84, 85, 86, 87, 88, 90, 93, 95, 96, 102, 103, 104, 109, 110, 111, 114, 115, 116, 118, 123, 124, 130, 133, 135, 137, 139, 140, 146, 147, 149, 153, 155

Offset: 1

N. J. A. Sloane, Apr 08 2000

Mordell's equation has a finite number of integral solutions for all nonzero n. Gebel computes the solutions for n < 10^5. Sequence A081121 gives n for which there are no integral solutions to y^2 = x^3 - n. See A081119 for the number of integral solutions to y^2 = x^3 + n. - T. D. Noe, Mar 06 2003

Numbers n such that A081119(n) = 0. - Charles R Greathouse IV, Apr 29 2015

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, page 192.
J. Gebel, A. Petho and H. G. Zimmer, On Mordell's equation, Compositio Mathematica 110 (3) (1998), 335-367.

T. D. Noe, Table of n, a(n) for n = 1..6603 (from Gebel)
Pantelis Andreou, Stavros Konstantinidis, and Taylor J. Smith, Improved Randomized Approximation of Hard Universality and Emptiness Problems, arXiv:2403.08707 [cs.DS], 2024. See p. 16.
Ryan D'Mello, Marshall Hall's Conjecture and Gaps Between Integer Points on Mordell Elliptic Curves, arXiv preprint arXiv:1410.0078, 2014
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
Eric Weisstein's World of Mathematics, Mordell Curve

Cf. A081119, A081121.

m = 155; f[_List] := ( xm = 2 xm; ym = Ceiling[xm^(3/2)];
Complement[Range[m], Outer[Plus, Range[0, ym]^2, -Range[-xm, xm]^3] //Flatten //Union]); xm=10; FixedPoint[f, {}] (* Jean-François Alcover, Apr 28 2011 *)

Apostol gives all values of n < 100. Extended by David W. Wilson, Sep 25 2000

A081120 Number of integral solutions to Mordell's equation y^2 = x^3 - n.

Original entry on oeis.org

1, 2, 0, 4, 0, 0, 4, 1, 0, 0, 4, 0, 2, 0, 2, 0, 0, 2, 2, 2, 0, 0, 2, 0, 2, 4, 1, 6, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 6, 2, 0, 0, 0, 2, 2, 0, 6, 4, 2, 0, 0, 0, 4, 2, 4, 2, 0, 0, 0, 4, 2, 0, 4, 1, 0, 0, 2, 0, 0, 0, 2, 2, 0, 2, 0, 4, 0, 0, 2, 0, 2, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 6

Offset: 1

T. D. Noe, Mar 06 2003

Mordell's equation has a finite number of integral solutions for all nonzero n.
Gebel, Pethö, and Zimmer (1998) computed the solutions for |n| <= 10^4. Bennett and Ghadermarzi (2015) extended this bound to |n| <= 10^7.
Sequence A081121 gives n for which there are no integral solutions. See A081119 for the number of integral solutions to y^2 = x^3 + n.
From Jianing Song, Aug 24 2022: (Start)
If A060951(n) = 0 (namely the elliptic curve y^2 = x^3 - n has rank 0), then:
- a(n) = 2 if n is of the form 432*t^6;
- a(n) = 1 if n is a cube;
- a(n) = 0 otherwise.
This follows from the complete description of the torsion group of y^2 = x^3 + n, using O to denote the point at infinity (see Exercise 10.19 of Chapter X of Silverman's Arithmetic of elliptic curves):
- If n = t^6 is a sixth power, then the torsion group consists of O, (2*t^2,+-3*t^3), (0,+-t^3), and (-t^2, 0).
- If n = t^2 is not a sixth power, then the torsion group consists of O and (0,+-t).
- If n = t^3 is not a sixth power, then the torsion group consists of O and (-t,0).
- If n is of the form -432*t^6, then the torsion group consists of O and (12*t^2,+-36*t^3).
- In all the other cases, the torsion group is trivial.
So a torsion point on y^2 = x^3 + n other than O is an integral point. If y^2 = x^3 + n has rank 0, then all the integral points on y^2 = x^3 + n are exactly the torsion points other than O.
Note that this result implies particularly that a(n) = a(n*t^6) for all t if A060951(n) = 0: the elliptic curve y^2 = x^3 - n*t^6 can be written as (y/t^3)^2 = (x/t^2)^3 - n, so it has the same Mordell-Weil group (hence the same rank and isomorphic torsion group) as y^2 = x^3 - n. (End)

			a(4)=4 refers to (x,y) = (2,+-2) and (5,+-11).

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, page 191.

Jean-François Alcover, Table of n, a(n) for n = 1..10000 [There were errors in the previous b-file, which had 10000 terms contributed by T. D. Noe and based on the work of J. Gebel.]
M. A. Bennett and A. Ghadermarzi, Mordell's equation: a classical approach. LMS J. Compute. Math. 18 (2015): 633-646. doi:10.1112/S1461157015000182 arXiv:1311.7077
J. Gebel, A. Pethö, and H. G. Zimmer, On Mordell's equation, Compositio Mathematica. 110:3 (1998): 335-367.
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
Joseph H. Silverman, The Arithmetic of Elliptic Curves.
Eric Weisstein's World of Mathematics, Mordell Curve.
Wikipedia, Mordell curve.

Cf. A081119, A081121. See A134109 for another version.

(* This naive approach gives correct results up to n=1000 *) xmax[] = 10^4; Do[ xmax[n] = 10^5, {n, {366, 775, 999}}]; Do[ xmax[n] = 10^6, {n, {207, 307, 847}}]; f[n] := (x = Floor[n^(1/3)] - 1; s = {}; While[ x <= xmax[n], x++; y2 = x^3 - n; If[y2 >= 0, y = Sqrt[y2]; If[ IntegerQ[y], AppendTo[s, y]]]]; s); a[n_] := (fn = f[n]; If[fn == {}, 0, 2 Length[fn] - If[ First[fn] == 0, 1, 0]]); Table[ an = a[n]; Print["a[", n, "] = ", an]; an, {n, 1, 100}] (* Jean-François Alcover, Mar 06 2012 *)

Edited by Max Alekseyev, Feb 06 2021

A179145 Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 1 integral solution.

Original entry on oeis.org

27, 125, 216, 1728, 2197, 3375, 4913, 6859, 8000, 13824, 19683, 24389, 27000, 29791, 59319, 68921, 74088, 79507, 91125, 103823, 110592, 132651, 140608, 148877, 157464, 166375, 195112, 205379, 216000, 226981, 238328, 287496, 300763, 314432

Offset: 1

Artur Jasinski, Jun 30 2010

nonn

Jianing Song, Table of n, a(n) for n = 1..115 (using the b-file of A356720, which is based on the data from A103254)
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]

Cf. A054504, A081119, A179145-A179162, A356709.
Complement of A356703 among the positive cubes.
Cf. also A179163, A179419.

(* Assuming every term is a cube *) xmax = 2000; r[n_] := Reap[ Do[ rpos = Reduce[y^2 == x^3 + n, y, Integers]; If[rpos =!= False, Sow[rpos]]; rneg = Reduce[y^2 == (-x)^3 + n, y, Integers]; If[rneg =!= False, Sow[rneg]], {x, 1, xmax}]]; ok[n_] := Which[ rn = r[n]; rn[[2]] === {}, False, Length[rn[[2]]] > 1, False, ! FreeQ[rn[[2, 1]], Or], False, True, True]; ok[n_ /; !IntegerQ[n^(1/3)]] = False; ok[1]=False; A179145 = Reap[ Do[ If[ok[n], Print[n]; Sow[n]], {n, 1, 320000}]][[2, 1]] (* Jean-François Alcover, Apr 12 2012 *)

a(n) = A356709(n)^3. - Jianing Song, Aug 24 2022

Edited and extended by Ray Chandler, Jul 11 2010

A179162 a(n) = least positive k such that Mordell's equation y^2 = x^3 + k has exactly n integral solutions.

Original entry on oeis.org

6, 27, 2, 343, 12, 1, 37, 8, 24, 512, 9, 35611289, 73, 10218313, 315, 129554216, 17, 274625, 297, 17576000, 2817, 200201625, 1737

Offset: 0

Artur Jasinski, Jun 30 2010

Additional known terms: a(24)=4481, a(26)=225, a(28)=2089, a(32)=1025.
For least positive k such that equation y^2 = x^3 - k has exactly n integral solutions, see A179175.
If n is odd, then a(n) is perfect cube. [Ray Chandler]

J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]

Cf. A054504, A081119, A179145-A179162.

Edited and a(11), a(13), a(15), a(17), a(19), a(21) added by Ray Chandler, Jul 11 2010

A006454 Solution to a Diophantine equation: each term is a triangular number and each term + 1 is a square.

Original entry on oeis.org

0, 3, 15, 120, 528, 4095, 17955, 139128, 609960, 4726275, 20720703, 160554240, 703893960, 5454117903, 23911673955, 185279454480, 812293020528, 6294047334435, 27594051024015, 213812329916328, 937385441796000, 7263325169820735, 31843510970040003, 246739243443988680

Offset: 0

N. J. A. Sloane, Jeffrey Shallit

Alternative definition: a(n) is triangular and a(n)/2 is the harmonic average of consecutive triangular numbers. See comments and formula section of A005563, of which this sequence is a subsequence. - Raphie Frank, Sep 28 2012
As with the Sophie Germain triangular numbers (A124174), 35 = (a(n) - a(n-6))/(a(n-2) - a(n-4)). - Raphie Frank, Sep 28 2012
Sophie Germain triangular numbers of the second kind as defined in A217278. - Raphie Frank, Feb 02 2013
Triangular numbers m such that m+1 is a square. - Bruno Berselli, Jul 15 2014
From Vladimir Pletser, Apr 30 2017: (Start)
Numbers a(n) which are the triangular number T(b(n)), where b(n) is the sequence A006451(n) of numbers n such that T(n)+1 is a square.
a(n) also gives the x solutions of the 3rd-degree Diophantine Bachet-Mordell equation y^2 = x^3 + K, with y = T(b(n))*sqrt(T(b(n))+1) = A285955(n) and K = T(b(n))^2 = A285985(n), the square of the triangular number of b(n) = A006451(n).
Also: This sequence is a subsequence of A000217(n), namely A000217(A006451(n)). (End)

			From _Raphie Frank_, Sep 28 2012: (Start)
35*(528 - 15) + 0 = 17955 = a(6),
35*(4095 - 120) + 3 = 139128 = a(7),
35*(17955 - 528) + 15 = 609960 = a(8),
35*(139128 - 4095) + 120 = 4726275 = a(9). (End)
From _Raphie Frank_, Feb 02 2013: (Start)
a(7) = 139128 and a(9) = 4726275.
a(9) = (2*(sqrt(8*a(7) + 1) - 1)/2 + 3*sqrt(a(7) + 1) + 1)^2 - 1 = (2*(sqrt(8*139128 + 1) - 1)/2 + 3*sqrt(139128 + 1) + 1)^2 - 1 = 4726275.
a(9) = 1/2*((3*(sqrt(8*a(7) + 1) - 1)/2 + 4*sqrt(a(7) + 1) + 1)^2 + (3*(sqrt(8*a(7) + 1) - 1)/2 + 4*sqrt(a(7) + 1) + 1)) = 1/2*((3*(sqrt(8*139128 + 1) - 1)/2 + 4*sqrt(139128 + 1) + 1)^2 + (3*(sqrt(8*139128 + 1) - 1)/2 + 4*sqrt(139128 + 1) + 1)) = 4726275. (End)
From _Vladimir Pletser_, Apr 30 2017: (Start)
For n=2, b(n)=5, a(n)=15
For n=5, b(n)=90, a(n)= 4095
For n = 3, A006451(n) = 15. Therefore, A000217(A006451(n)) = A000217(15) = 120. (End)

Edward J. Barbeau, Pell's Equation, New York: Springer-Verlag, 2003, p. 17, Exercise 1.2.
Allan J. Gottlieb, How four dogs meet in a field, and other problems, Technology Review, Jul/August 1973, pp. 73-74.
Vladimir Pletser, On some solutions of the Bachet-Mordell equation for large parameter values, to be submitted, April 2017.
Jeffrey Shallit, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vladimir Pletser, Table of n, a(n) for n = 0..1000 (first 60 terms from Vincenzo Librandi)
M.A. Bennett and A. Ghadermarzi, Data on Mordell's curve.
Michael A. Bennett and Amir Ghadermarzi, Mordell's equation : a classical approach, arXiv:1311.7077 [math.NT], 2013.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992, arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992.
Jeffrey Shallit, Letter to N. J. A. Sloane, Oct. 1975.
K. B. Subramaniam, Almost Square Triangular Numbers, The Fibonacci Quarterly, Vol. 37, No. 3 (1999), pp. 194-197.
Eric Weisstein's World of Mathematics, Mordell Curve.
Index entries for linear recurrences with constant coefficients, signature (1,34,-34,-1,1).

Cf. sqrt(a(n) + 1) = A006452(n + 1) = A216162(2n + 2) and (sqrt(8a(n) + 1) - 1)/2 = A006451.
Cf. A217278, A124174, A216134. - Raphie Frank, Feb 02 2013
Subsequence of A182334.
Cf. A001109, A245031.
Cf. A285955, A285985, A000217, A006451, A081119, A054504. - Vladimir Pletser, Apr 30 2017

I:=[0,3,15,120,528,4095]; [n le 6 select I[n] else 35*(Self(n-2) - Self(n-4)) + Self(n-6): n in [1..30]]; // Vincenzo Librandi, Dec 21 2015

A006454:=-3*z*(1+4*z+z**2)/(z-1)/(z**2-6*z+1)/(z**2+6*z+1); # conjectured (correctly) by Simon Plouffe in his 1992 dissertation
restart: bm2:=-1: bm1:=0: bp1:=2: bp2:=5: print ('0,0','1,3','2,15'); for n from 3 to 1000 do b:= 8*sqrt((bp1^2+bp1)/2+1)+bm2; a:=b*(b+1)/2; print(n,a); bm2:=bm1; bm1:=bp1; bp1:=bp2; bp2:=b; end do: # Vladimir Pletser, Apr 30 2017

Clear[a]; a[0] = a[1] = 1; a[2] = 2; a[3] = 4; a[n_] := 6a[n - 2] - a[n - 4]; Array[a, 40]^2 - 1 (* Vladimir Joseph Stephan Orlovsky, Mar 03 2011 *)
LinearRecurrence[{1,34,-34,-1,1},{0,3,15,120,528},30] (* Harvey P. Dale, Feb 18 2023 *)

concat(0, Vec(3*x*(1 + 4*x + x^2) / ((1 - x)*(1 - 6*x + x^2)*(1 + 6*x + x^2)) + O(x^30))) \\ Colin Barker, Apr 30 2017

a(n) = A006451(n)*(A006451(n)+1)/2.
a(n) = A006452(n)^2 - 1. - Joerg Arndt, Mar 04 2011
a(n) = 35*(a(n-2) - a(n-4)) + a(n-6). - Raphie Frank, Sep 28 2012
From Raphie Frank, Feb 01 2013: (Start)
a(0) = 0, a(1) = 3, and a(n+2) = (2x + 3y + 1)^2 - 1  = 1/2*((3x + 4y + 1)^2 + (3x + 4y + 1)) where x = (sqrt(8*a(n) + 1) - 1)/2 = A006451(n) =  1/2*(A216134(n + 1) + A216134(n - 1)) and y = sqrt(a(n) + 1) = A006452(n + 1) = 1/2*(A216134(n + 1) - A216134(n - 1)).
Note that A216134(n + 1) = x + y, and A216134(n + 3) = (2x + 3y + 1) + (3x + 4y + 1) = (5x + 7y + 2), where A216134 gives the indices of the Sophie Germain triangular numbers. (End)
a(n) = (1/64)*(((4 + sqrt(2))*(1 -(-1)^(n+1)*sqrt(2))^(2* floor((n+1)/2)) + (4 - sqrt(2))*(1 + (-1)^(n+1)*sqrt(2))^(2*floor((n+1)/2))))^2 - 1. - Raphie Frank, Dec 20 2015
From Vladimir Pletser, Apr 30 2017: (Start)
Since b(n) = 8*sqrt(T(b(n-2))+1)+ b(n-4) = 8*sqrt((b(n-2)*(b(n-2)+1)/2)+1)+ b(n-4), with b(-1)=-1, b(0)=0, b(1)=2, b(2)=5 (see A006451) and a(n) = T(b(n)) (this sequence), we have:
a(n) = ((8*sqrt((b(n-2)*(b(n-2)+1)/2)+1)+ b(n-4))*(8*sqrt((b(n-2)*(b(n-2)+1)/2)+1)+ b(n-4)+1)/2). (End)
From Colin Barker, Apr 30 2017: (Start)
G.f.: 3*x*(1 + 4*x + x^2) / ((1 - x)*(1 - 6*x + x^2)*(1 + 6*x + x^2)).
a(n) = a(n-1) + 34*a(n-2) - 34*a(n-3) - a(n-4) + a(n-5) for n > 4.
(End)
a(n)  = (A001109(n/2+1) - 2*A001109(n/2))^2 - 1 if n is even, and (A001109((n+3)/2) - 4*A001109((n+1)/2))^2 - 1 if n is odd (Subramaniam, 1999). - Amiram Eldar, Jan 13 2022

Better description from Harvey P. Dale, Jan 28 2001
More terms from Larry Reeves (larryr(AT)acm.org), Feb 07 2001
Minor edits by N. J. A. Sloane, Oct 24 2009

A060950 Rank of elliptic curve y^2 = x^3 + n.

Original entry on oeis.org

0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 2, 0, 2, 1, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 2, 1, 1, 1, 1, 0, 2, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 2, 1, 0, 0, 1, 1, 2, 0, 2, 1, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 0, 0, 0, 0, 2, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1

Offset: 1

N. J. A. Sloane, May 10 2001

The curves for n and -27*n are isogenous (as Noam Elkies points out--see Womack), so they have the same rank. - Jonathan Sondow, Sep 10 2013

			a(1) = A060951(27) = a(729) = 0. - _Jonathan Sondow_, Sep 10 2013

T. D. Noe, Table of n, a(n) for n = 1..10000 (from Gebel)
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
H. Mishima, Tables of Elliptic Curves
T. Womack, Minimal-known positive and negative k for Mordell curves of given rank

Cf. A031507, A002151, A002153, A002155, A102833, A179124.
Cf. A060748, A060838, A060951, A060952, A060953.
Cf. A081119 (number of integral solutions to Mordell's equation y^2 = x^3 + n).

a(n) = ellanalyticrank(ellinit([0, 0, 0, 0, n]))[1] \\ Jianing Song, Aug 24 2022

apply( {A060950(n)=ellrank(ellinit([0, n]))[1]}, [1..99]) \\ For PARI version  < 2.14, use ellanalyticrank(...). - M. F. Hasler, Jul 01 2024

a(n) = A060951(27*n) and A060951(n) = a(27*n), so a(n) = a(729*n). - Jonathan Sondow, Sep 10 2013

Corrected by James R. Buddenhagen, Feb 18 2005

A031507 a(n) = smallest k>0 such that the elliptic curve y^2 = x^3 + k has rank n, or -1 if no such k exists.

Original entry on oeis.org

1, 2, 15, 113, 2089, 66265, 1358556

Offset: 0

Noam D. Elkies

See A031508 for the smallest negative k. - Artur Jasinski, Nov 21 2011
See A060950 for the rank of y^2 = x^3 + n. - Jonathan Sondow, Sep 10 2013
Gebel, Pethö, & Zimmer: "One experimental observation derived from the tables is that the rank r of Mordell's curves grows according to r = O(log |k|/|log log |k||^(2/3))." Hence this fit suggests a(n) >> exp(n (log n)^(1/3)) where >> is the Vinogradov symbol. - Charles R Greathouse IV, Sep 10 2013
The curves for k and -27*k are isogenous (as Noam Elkies points out---see Womack), so they have the same rank. - Jonathan Sondow, Sep 10 2013
Womack (2003) gives further upper bounds: a(7) <= 47550317, a(8) <= 1632201497, a(9) <= 185418133372, a(10) <=  68513487607153. - M. F. Hasler, Jul 01 2024
The three questions for arbitrary k, positive k, and negative k are not very far from each other because the curves for k and -27k are related by a 3-isogeny and therefore have the same rank. It would be most natural to ask for the minimal |k| for k of either sign [see A373795]. - Noam D. Elkies,  Jul 02 2024
a(16) <= 1160221354461565256631205207888 (Elkies, ANTS-XVI, 2024). The same article also establishes the existence of a value of k which has rank >= 17. - N. J. A. Sloane, Jul 05 2024

			a(12) <= 27*A031508(12) <= 27*6533891544658786928 = 176415071705787247056 (from Quer 1987 and Womack). - _Jonathan Sondow_, Sep 10 2013

Noam D. Elkies, Rank of an elliptic curve and 3-rank of a quadratic field via the Burgess bounds, 2024 Algorithmic Number Theory Symposium, ANTS-XVI, MIT, July 2024.

J. E. Cremona, Elliptic Curve Data
Noam D. Elkies and Zev Klagsbrun, New rank records for elliptic curves having rational torsion, ANTS XIV—Proceedings of the Fourteenth Algorithmic Number Theory Symposium, 233-250. Mathematical Sciences Publishers, Berkeley, CA, 2020.
J. Gebel, Integer points on Mordell curves, web.archive.org copy of the "MORDELL+" file on the SIMATH web site shut down in 2017. [Locally cached copy].
J. Gebel, A. Pethö and H. G. Zimmer, On Mordell's equation, Compositio Math. 110 (1998), 335-367. (doi:10.1023/A:1000281602647 not working as of July 2024.)
J. Quer, Corps quadratiques de 3-rang 6 et courbes elliptiques de rang 12, C. R. Acad. Sc. Paris I, 305 (1987), 215-218.
Tom Womack, Explicit Descent on Elliptic Curves, PhD thesis, University of Nottingham, July 2003.
Tom Womack, Minimal-known positive and negative k for Mordell curves of given rank (personal web page, latest available snapshot on web.archive.org from Jan. 2017), last modified Oct. 2002.

Cf. A031508, A373795.

{A031507(n)=for(k=1, oo, ellrank(ellinit([0, k]))[1]==n && return(k))} \\ Use ellanalyticrank() for PARI version < 2.14. - M. F. Hasler, Jul 01 2024

a(n) <= 27*A031508(n) and A031508(n) <= 27*a(n). - Jonathan Sondow, Sep 10 2013

Definition clarified by Jonathan Sondow, Oct 26 2013

Escape clause added to definition by N. J. A. Sloane, Jun 29 2024, because, as John Cremona reminds me, it is not known if k always exists.

A356709 Numbers k such that Mordell's equation y^2 = x^3 + k^3 has exactly 1 integral solution.

Original entry on oeis.org

3, 5, 6, 12, 13, 15, 17, 19, 20, 24, 27, 29, 30, 31, 39, 41, 42, 43, 45, 47, 48, 51, 52, 53, 54, 55, 58, 59, 60, 61, 62, 66, 67, 68, 69, 73, 75, 76, 77, 79, 80, 82, 83, 85, 87, 89, 93, 94, 96, 97, 101, 102, 103, 106, 107, 108, 109, 111, 113, 115, 116, 117, 118, 119

Offset: 1

Jianing Song, Aug 23 2022

nonn

Numbers k such that Mordell's equation y^2 = x^3 + k^3 has no solution other than the trivial solution (-k,0).

Cube root of A179145.

			3 is a term since the equation y^2 = x^3 + 3^3 has no solution other than (-3,0).

Jianing Song, Table of n, a(n) for n = 1..115 (using the b-file of A356720, which is based on the data from A103254)

Cf. A081119, A179145, A179147, A179149, A179151, A356710, A356711, A356712.
Indices of 1 in A356706, of 0 in A356707, and of 1 in A356708.
Complement of A356720.
Cf. also A356713, A228948.

A134108 Number of integral solutions with nonnegative y to Mordell's equation y^2 = x^3 + n.

Original entry on oeis.org

3, 1, 1, 1, 1, 0, 0, 4, 5, 1, 0, 2, 0, 0, 2, 1, 8, 1, 1, 0, 0, 1, 0, 4, 1, 1, 1, 2, 0, 1, 1, 0, 1, 0, 1, 4, 3, 1, 0, 1, 1, 0, 1, 2, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 3, 0, 0, 0, 0, 0, 2, 3, 4, 0, 0, 2, 0, 0, 1, 1, 6, 0, 0, 1, 0, 0, 1, 4, 1, 1, 0, 0, 0, 0, 0, 0, 4, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 6, 2, 0, 0, 0, 1

Offset: 1

Klaus Brockhaus, Oct 08 2007, Oct 14 2007

nonn

a(n) = A081119(n)/2 if A081119(n) is even, (A081119(n)+1)/2 if A081119(n) is odd (i.e. if n is a cubic number).

Comment from T. D. Noe, Oct 12 2007: In sequences A134108 (this entry) and A134109 dealing with the equation y^2 = x^3 + n, one could note that these are Mordell equations. Here are some related sequences: A054504, A081119, A081120, A081121. The link "Integer points on Mordell curves" has data on 20000 values of n. A134108 and A134109 count only solutions with y >= 0 and can be derived from A081119 and A081120.

			y^2 = x^3 + 1 has solutions (y, x) = (0, -1), (1, 0) and (3, 2), hence a(1) = 3.
y^2 = x^3 + 6 has no solutions, hence a(6) = 0.
y^2 = x^3 + 17 has 8 solutions (see A029727, A029728), hence a(17) = 8.
y^2 = x^3 + 27 has solution (y, x) = (0, -3), hence a(27) = 1.

Jean-François Alcover, Table of n, a(n) for n = 1..10000
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
Eric Weisstein's World of Mathematics, Mordell Curve

Cf. A081119, A029727, A029728, A134109.

[ #{ Abs(p[2]) : p in IntegralPoints(EllipticCurve([0, n])) }: n in [1..122] ];

(* This naive approach gives correct results up to n=1000 *) xmax[] = 10^4; Do[ xmax[n] = 10^5, {n, {297, 377, 427, 885, 899}}]; Do[ xmax[n] = 10^6, {n, {225, 353, 618}}]; f[n] := (x = -Ceiling[n^(1/3)] - 1; s = {}; While[x <= xmax[n], x++; y2 = x^3 + n; If[y2 >= 0, y = Sqrt[y2]; If[IntegerQ[y], AppendTo[s, y]]]]; s); a[n_] := a[n] = (fn = f[n]; an = If[fn == {}, 0, 2 Length[fn] - If[First[fn] == 0, 1, 0]]; If[EvenQ[an], an/2, (an + 1)/2]); Table[ Print["a[", n, "] = ", a[n] ]; a[n], {n, 1, 105}] (* Jean-François Alcover, Feb 20 2012 *)
A081119 = Cases[Import["https://oeis.org/A081119/b081119.txt", "Table"], {, }][[All, 2]];
a[n_] := With[{an = A081119[[n]]}, If[EvenQ[an], an/2, (an + 1)/2]];
a /@ Range[10000] (* Jean-François Alcover, Nov 24 2019 *)

cp's OEIS Frontend

A356701 Records values in A081119.

Views

Author

Keywords

Examples

Crossrefs

A054504 Numbers n such that Mordell's equation y^2 = x^3 + n has no integral solutions.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Extensions

A081120 Number of integral solutions to Mordell's equation y^2 = x^3 - n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Extensions

A179145 Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 1 integral solution.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A179162 a(n) = least positive k such that Mordell's equation y^2 = x^3 + k has exactly n integral solutions.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A006454 Solution to a Diophantine equation: each term is a triangular number and each term + 1 is a square.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A060950 Rank of elliptic curve y^2 = x^3 + n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

Formula

Extensions

A031507 a(n) = smallest k>0 such that the elliptic curve y^2 = x^3 + k has rank n, or -1 if no such k exists.

Views

Author