A154333 -id:A154333 - cp's OEIS frontend

A179386 Records of minima of A154333, difference of a cube minus the next smaller square.

2, 4, 7, 26, 28, 47, 49, 60, 63, 174, 207, 307, 7670, 15336, 18589, 22189, 37071, 44678, 63604, 64432

Offset: 1

Artur Jasinski, Jul 13 2010, Aug 03 2010

"Records of minima" here means values A154333(x) such that A154333(x') > A154333(x) for all x' > x, or equivalently, the range of m(x) = min{ A154333(x') ; x' > x }. - M. F. Hasler, Sep 27 2013
For the associated x values see A179387 (and example).
For the associated values y=max{ y | y^2 < x^3 }, see A179388.
From Artur Jasinski, Jul 13 2010: (Start)
Theorem (*Artur Jasinski*)
For any positive number x >= A179387(n) the distance between cube of x and square of any y (such that x<>n^2 and y<>n^3) can't be less than A179386(n).
Proof: The number of integral points of each Mordell elliptic curve of the form x^3-y^2 = k is finite and completely computable, therefore such x can't exist.
(End)
An equivalent theorem is the following (*Artur Jasinski*): For any positive number x >= 1+A179387(n) distance between cube of x and square of any y (such that x<>n^2 and y<>n^3) can't be less than A179386(n+1). - Artur Jasinski, Aug 11 2010
Also: The range of b(n) = min { A181138(m) | m>n }. - M. F. Hasler, Sep 26 2013
Indeed, if k=A154333(x) is a member if this sequence A179386, then also k=A181138(y) for the corresponding y, and since there is no larger x' such that x'^3-y'^3 <= k, there cannot be a larger y' such that k=A181138(y') (since this y' would require a corresponding x' > x). Conversely, the same reasoning holds for "records of minima" in A181138. - M. F. Hasler, Sep 26 and Sep 28 2013

			For numbers x > 32, A154333(x) > 7.
For numbers x > 35, A154333(x) > 26.
For numbers x > 37, A154333(x) > 28.
For numbers x > 63, A154333(x) > 47.
For numbers x > 65, A154333(x) > 49.
For numbers x > 136, A154333(x) > 60.
For numbers x > 568, A154333(x) > 63.
For numbers x > 5215, A154333(x) > 174.
For numbers x > 367806, A154333(x) > 207.
For numbers x > 939787, A154333(x) > 307.

J. Calvo, J. Herranz, G. Saez, A new algorithm to search for small nonzero |x^3 - y^2| values, Math. Comp. 78 (2009), 2435-2444.
Noam Elkies, Rational points near curves and small nonzero |x^3 - y^2| via lattice reduction arXiv:math/0005139 [math.NT], 2000.
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]
J. Gebel, A. Petho, G. Zimmer, On Mordell's equation, Compositio Mathematica 110 (1998), 335-367. MR1602064

Cf. A179107, A179108, A179109, A179387, A179388.

max = 1000; vecd = Table[10^100, {n, 1, max}]; vecx = Table[10^100, {n, 1, max}]; vecy = Table[10^100, {n, 1, max}]; len = 1; min = 10^100; Do[m = Floor[(n^3)^(1/2)]; k = n^3 - m^2; If[k != 0, If[k <= min, ile = 0; Do[If[vecd[[z]] < k, ile = ile + 1], {z, 1, len}]; len = ile + 1; min = 10^100; vecd[[len]] = k; vecx[[len]] = n; vecy[[len]] = m]], {n, 1, 13333677}]; dd = {}; xx = {}; yy = {}; Do[AppendTo[dd, vecd[[n]]]; AppendTo[xx, vecx[[n]]]; AppendTo[yy, vecy[[n]]], {n, 1, len}]; dd

Edited by M. F. Hasler, Sep 27 2013

A179388 Values y for records of minima of positive distances d = A179386(n) = A154333(x) = x^3 - y^2.

Original entry on oeis.org

5, 11, 181, 207, 225, 500, 524, 1586, 13537, 376601, 223063347, 911054064, 16073515093, 22143115844, 29448160810, 1661699554612, 2498973838515, 26588790747913, 27582731314539, 178638660622364

Offset: 1

Artur Jasinski, Jul 12 2010, Jul 13 2010, Aug 03 2010

"Records of minima" means values A179386(n)=A154333(x) such that A154333(x') > A154333(x) for all x' > x, or equivalently A181138(y) such that A181138(y') > A181138(y) for all y' > y. See the main entry A179386 for all further considerations. - M. F. Hasler, Sep 30 2013
For d values see A179386, for x values see A179387.
Theorem (Artur Jasinski):
For any positive number x >= A179387(n), the distance between the cube of x and the square of any y (with x<>n^2 and y<>n^3) can't be less than A179386(n).
Proof: Because number of integral points of each Mordell elliptic curve of the form x^3-y^2 = k is finite and completely computable there can't exist any such x (or the related y).

Cf. A179107, A179108, A179109, A179387, A179388.

Cf. A181138, A229618, A077116, A106265, A165288.

max = 1000; vecd = Table[10100, {n, 1, max}]; vecx = Table[10100, {n, 1, max}]; vecy = Table[10100, {n, 1, max}]; len = 1; min = 10100; Do[m = Floor[(n^3)^(1/2)]; k = n^3 - m^2; If[k != 0, If[k <= min, ile = 0; Do[If[vecd[[z]] < k, ile = ile + 1], {z, 1, len}]; len = ile + 1; min = 10100; vecd[[len]] = k; vecx[[len]] = n; vecy[[len]] = m]], {n, 1, 13333677}]; dd = {}; xx = {}; yy = {}; Do[AppendTo[dd, vecd[[n]]]; AppendTo[xx, vecx[[n]]]; AppendTo[yy, vecy[[n]]], {n, 1, len}]; yy (*Artur Jasinski*)

A179388(n) = sqrt(A179387(n)^3 - A179386(n)).

Edited by M. F. Hasler, Sep 30 2013

A179387 Values x for "records of minima" of positive distances d = A179386(n) = A154333(x) = x^3 - y^2.

Original entry on oeis.org

3, 5, 32, 35, 37, 63, 65, 136, 568, 5215, 367806, 939787, 6369039, 7885438, 9536129, 140292677, 184151166, 890838663, 912903445, 3171881612

Offset: 1

Artur Jasinski, Jul 12 2010, Jul 13 2010, Aug 03 2010

"Records of minima" means values A154333(x) such that A154333(x') > A154333(x) for all x' > x. See the main entry A179386 for all further considerations. - M. F. Hasler, Sep 30 2013
For d values see A179386; For y values see A179388.
Theorem (Artur Jasinski):
For any positive number x >= A179387(n) distance between cube of x and square of any y (such that x<>n^2 and y<>n^3) can't be less than A179386(n).
Proof: Because number of integral points of each Mordell elliptic curve of the form x^3-y^2 = k is finite and complete computable can't existed such x.
From Artur Jasinski, Aug 11 2010: (Start)
An equivalent theorem is the following (Artur Jasinski):
For any positive number x >= 1+A179387(n) distance between cube of x and square of any y (such that x<>n^2 and y<>n^3) can't be less than A179386(n+1).
(End)

Cf. A179107, A179108, A179109, A179387, A179388

max = 1000; vecd = Table[10100, {n, 1, max}]; vecx = Table[10100, {n, 1, max}]; vecy = Table[10100, {n, 1, max}]; len = 1; min = 10100; Do[m = Floor[(n^3)^(1/2)]; k = n^3 - m^2; If[k != 0, If[k <= min, ile = 0; Do[If[vecd[[z]] < k, ile = ile + 1], {z, 1, len}]; len = ile + 1; min = 10100; vecd[[len]] = k; vecx[[len]] = n; vecy[[len]] = m]], {n, 1, 13333677}]; dd = {}; xx = {}; yy = {}; Do[AppendTo[dd, vecd[[n]]]; AppendTo[xx, vecx[[n]]]; AppendTo[yy, vecy[[n]]], {n, 1, len}]; xx (*Artur Jasinski*)

Edited by M. F. Hasler, Sep 30 2013

A154332 Least positive integer m such that A087285(n) = A154333(m) = m^3 - next smaller square.

Original entry on oeis.org

3, 2, 32, 15, 17, 4, 7, 6, 35, 8, 11, 10, 14, 21, 12, 28, 65, 9, 56, 18, 136, 568, 23, 99, 101, 20, 13, 27, 34, 30, 143, 145, 38, 16, 19, 47, 195, 91, 197, 175, 26, 51, 59, 799, 69, 62, 163, 255, 257, 66, 31, 717, 2904, 33, 377, 79, 323, 325, 25

Offset: 1

M. F. Hasler, Jan 07 2009

nonn

The terms of this sequence constitute a "proof" for the terms listed in A087285. To prove that a number is NOT in A087285, one can check the finite number (A081120) of solutions to the corresponding Mordell equation, cf. references in A081121.

A154332(n) = { local(m); until(m++^3-sqrtint(m^3-1)^2==A087285[n],); m }

A087285(n) = A154333(a(n)) = a(n)^3 - [sqrt(a(n)^3 - 1)]^2 = A000578(a(n)) - A048760(a(n)^3-1).

A077116 n^3 - A065733(n).

Original entry on oeis.org

0, 0, 4, 2, 0, 4, 20, 19, 28, 0, 39, 35, 47, 81, 40, 11, 0, 13, 56, 135, 79, 45, 39, 67, 135, 0, 152, 83, 48, 53, 104, 207, 7, 216, 100, 26, 0, 28, 116, 270, 496, 277, 104, 546, 503, 524, 615, 139, 368, 0, 391, 155, 732, 652, 648, 726, 55, 293, 631, 170, 704

Offset: 0

Reinhard Zumkeller, Oct 29 2002

a(n) = 0 for n = m^2. - Zak Seidov, May 11 2007

It has been asked whether some primes do not occur in this sequence. It seems indeed that primes 3, 5, 17, 23, 29, 31, 37, 41, 43, 59, 61,... do not occur, primes 2, 7, 11, 13, 19, 47, 53, 67, 79, 83,... do. For further investigations, see A087285 = the range of this sequence, and also the related sequences A229618 = range of A181138, and A165288. - M. F. Hasler, Sep 26 2013 and Oct 05 2013

			A065733(10) = 961 = 31^2 is the largest square less than or equal to 10^3 = 1000, therefore a(10) = 1000 - 961 = 39.

Cf. A000578, A070929, A077118, A077119, A075847.

A077116 := proc(n)
    A053186(n^3) ;
end proc: # R. J. Mathar, Jul 12 2016

Table[c = n^3; c - Floor[Sqrt[c]]^2, {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Jun 02 2011 *)

A077116(n)=n^3-sqrtint(n^3)^2 \\ - M. F. Hasler, Sep 26 2013

a(n) = A154333(n) unless n is a square or, equivalently, a(n)=0. - M. F. Hasler, Oct 05 2013

a(n) = A053186(n^3). - R. J. Mathar, Jul 12 2016

cp's OEIS Frontend

A179386 Records of minima of A154333, difference of a cube minus the next smaller square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A179388 Values y for records of minima of positive distances d = A179386(n) = A154333(x) = x^3 - y^2.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

Extensions

A179387 Values x for "records of minima" of positive distances d = A179386(n) = A154333(x) = x^3 - y^2.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Extensions

A154332 Least positive integer m such that A087285(n) = A154333(m) = m^3 - next smaller square.

Views

Author

Keywords

Comments

Programs

PARI

Formula

A077116 n^3 - A065733(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

PARI

Formula