A229618 -id:A229618 - cp's OEIS frontend

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

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

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

A087285 Possible differences between a cube and the next smaller square.

Original entry on oeis.org

2, 4, 7, 11, 13, 15, 19, 20, 26, 28, 35, 39, 40, 45, 47, 48, 49, 53, 55, 56, 60, 63, 67, 74, 76, 79, 81, 83, 100, 104, 107, 109, 116, 127, 135, 139, 146, 147, 148, 150, 152, 155, 170, 174, 180, 184, 186, 191, 193, 200, 207, 212, 215, 216, 233, 235, 242, 244, 249

Offset: 1

Hugo Pfoertner, Sep 18 2003

nonn

Sequence and program were provided by Ralf Stephan Aug 28 2003.
Comment from David W. Wilson, Jan 05 2009: I believe there is an algorithm for solving x^3 - y^2 = k, which should have a finite number of solutions for any k. That means that we should in principle be able to compute this sequence.
Up to the initial 0 in A165288, these two sequences appear to be the same, but according to its current definition, A165288 should be the same as the (different) sequence A229618 = the range of the sequence A181138 (= least k>0 such that n^2+k is a cube): If n^2+k=y^3 is the smallest cube above n^2, then n^2 is not necessarily the largest square below y^3. E.g., 18 is in A181138 and A229618, since 9+18=27 is the least cube above 9=3^2, but 25=5^2 is the largest square below 27. - M. F. Hasler, Oct 05 2013

			a(1)=2 because the next smaller square below 3^3=27 is 5^2=25.

See under A081121.

Cf. A087286, A088017, A081121, A077116, A065733.

v=vector(200):for(n=2,10^7,t=n^3:s=sqrtint(t)^2: if(s==t,s=sqrtint(t-1)^2):tt=t-s: if(tt>0&&tt<=200&&!v[tt],v[tt]=n)):for(k=1,200,if(v[k],print1(k",")))

A181138 Least positive integer k such that n^2 + k is a cube.

Original entry on oeis.org

1, 7, 4, 18, 11, 2, 28, 15, 61, 44, 25, 4, 72, 47, 20, 118, 87, 54, 19, 151, 112, 71, 28, 200, 153, 104, 53, 271, 216, 159, 100, 39, 307, 242, 175, 106, 35, 359, 284, 207, 128, 47, 433, 348, 261, 172, 81, 535, 440, 343, 244, 143, 40, 566, 459, 350, 239, 126, 11

Offset: 0

Jason Earls, Oct 06 2010

a(n) = A070923(n) if n is not cube. Zak Seidov, Mar 26 2013

See A229618 for the range of this sequence. A179386 gives the range of b(n) = min{ a(m); m >= n }. The indices of jumps in this sequence are given in A179388 = { n | a(m)>a(n) for all m > n } = { 0, 5, 11, 181, 207, 225, 500, 524, 1586, ... }. - M. F. Hasler, Sep 26 2013

			a(11) = 4 because 11^2 + k is never a cube for k < 4, but 11^2 + 4 = 5^3. - _Bruno Berselli_, Jan 29 2013

Bruno Berselli, Table of n, a(n) for n = 0..1000 (Corrected Jan 19 2019)

Cf. A070923, A077116.

S:=[];
k:=1;
for n in [0..60] do
   while not IsPower(n^2+k,3) do
        k:=k+1;
   end while;
   Append(~S, k);
   k:=1;
end for;
S;  // Bruno Berselli, Jan 29 2013

Table[(1 + Floor[n^(2/3)])^3 - n^2, {n, 100}] (* Zak Seidov, Mar 26 2013 *)

A181138(n)=(sqrtnint(n^2,3)+1)^3-n^2 \\ Charles R Greathouse IV, Mar 26 2013

a(n) << n^(4/3). - Charles R Greathouse IV, Mar 26 2013

Extended to a(0)=1 by M. F. Hasler, Sep 26 2013

A165288 Possible values of the difference between a cube and the largest square not larger than the cube.

Original entry on oeis.org

0, 2, 4, 7, 11, 13, 19, 20, 26, 28, 35, 39, 40, 45, 47, 48, 49, 53, 55, 56, 60, 63, 67, 74, 76, 79, 81, 83, 100, 104, 107, 109, 116, 135, 139, 146, 147, 148, 150, 152, 155, 170, 174, 180, 184, 186, 191, 193, 200, 207, 212, 215, 216, 233, 235, 242, 244, 251, 270, 277

Offset: 1

Vladimir Joseph Stephan Orlovsky, Sep 13 2009

nonn

The values of A077116, sorted and duplicates removed.
Note that the values have been generated with a finite search radius and are not proved to be complete. [R. J. Mathar, Oct 09 2009]
Except for the leading 0, a subsequence of A229618 which is in turn (except for the initial 1) a subsequence of A106265.  The values {15, 18, 25, 44, 54, 61, 71, 72, 87, 106, 112, 118, 126, 127,...} are in  A229618 but not in the present sequence. Using results from A179386, it should be possible to prove that the sequence is complete up to a given point. - M. F. Hasler, Sep 26 2013

			The gap 0 appears in 1^3-1^2 or 4^3-8^2 etc.
The gap 2 appears for example in 3^3-5^2.
The gap 4 appears for example in 2^3-2^2 or 5^3-11^2.
The gap 19 appears in 7^3-18^2, the gap 20 in 6^3-14^2.

Essentially the same as A087285.

lst={};Do[a=n^3-Floor[Sqrt[n^3]]^2;If[a<=508,AppendTo[lst,a]],{n,2*8!}]; Take[Union@lst,90]

Edited by R. J. Mathar, Oct 09 2009

Name corrected by M. F. Hasler, Oct 05 2013

A228948 Numbers n such that n^3 + k^2 = m^3 for some k>0, m>0.

Original entry on oeis.org

6, 7, 11, 23, 24, 26, 28, 31, 38, 42, 44, 47, 54, 55, 61, 63, 84, 91, 92, 95, 96, 99, 104, 110, 111, 112, 118, 119, 124, 138

Offset: 1

M. F. Hasler, Oct 05 2013

nonn

Cube root of perfect cubes in A087285 or in A229618 are in the present sequence, but this does not yield all terms, because these sequences require k^2 to be the largest square < m^3.

Numbers k such that Mordell's equation y^2 = x^3 - k^3 has more than 1 integral solution. (Note that it is necessary that x is positive.) In other words, numbers k such that Mordell's equation y^2 = x^3 - k^3 has solutions other than the trivial solution (k,0). - Jianing Song, Sep 24 2022

			6 is a term since the equation y^2 = x^3 - 6^3 has 5 solutions (6,0), (10,+-28), and (33,+-189). - _Jianing Song_, Sep 24 2022

Cf. A229618, A087285, A087286, A088017, A081121, A081120, A077116, A065733.
Cube root of A179419.
Cf. A356709, A356720. Complement of A356713.

More terms added by Jianing Song, Sep 24 2022 based on A179419.

cp's OEIS Frontend

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

A077116 n^3 - A065733(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A087285 Possible differences between a cube and the next smaller square.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

PARI

A181138 Least positive integer k such that n^2 + k is a cube.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A165288 Possible values of the difference between a cube and the largest square not larger than the cube.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A228948 Numbers n such that n^3 + k^2 = m^3 for some k>0, m>0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions