login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060467 Value of z of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|. 5

%I #33 Jun 11 2020 16:54:28

%S 0,1,1,1,2,2,2,2,2,3,-11,2,1626,2,3,3,3,16,15584139827,3,3,3,3,3,

%T 2220422932,8866128975287528,3,3,3,4,4,-159380,-80538738812075974,3,8,

%U 4,3,-8,31,-796,-61922712865,3,12,3,22,4,5,5,3,4,4,4,4,5,-21,4,-10,4

%N Value of z of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|.

%C Indexed by A060464.

%C Only primitive solutions where gcd(x,y,z) does not divide n are considered.

%C From the solution A060464(24) = 30 = -283059965^3 - 2218888517^3 + 2220422932^3 (smallest possible magnitudes according to A. Bogomolny), one has a(24) = 2220422932. A solution to A060464(25) = 33 remains to be found. Other values for larger n can be found in the last column of the table on Hisanori Mishima's web page. - _M. F. Hasler_, Nov 10 2015

%D R. K. Guy, Unsolved Problems in Number Theory, Section D5.

%H A. Bogomolny, <a href="http://www.cut-the-knot.org/arithmetic/algebra/FinikyDiophantineEquations.shtml">Finicky Diophantine Equations</a> on cut-the-knot.org, accessed Nov. 10, 2015.

%H A.-S. Elsenhans, J. Jahnel, <a href="http://dx.doi.org/10.1090/S0025-5718-08-02168-6">New sums of three cubes</a>, Math. Comp. 78 (2009) 1227-1230.

%H K. Koyama, Y. Tsuruoka, H. Sekigawa, <a href="http://dx.doi.org/10.1090/S0025-5718-97-00830-2">On searching for solutions of the Diophantine equation x^3+y^3+z^3=n</a>, Math. Comp. 66 (1997) 841.

%H Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/math04/matb0100.htm">About n=x^3+y^3+z^3</a>

%H Eric S. Rowland, <a href="https://ericrowland.github.io/papers/Known_families_of_integer_solutions_of_x^3+y^3+z^3=n.pdf">Known families of integer solutions of x^3+y^3+z^3=n</a>

%H A. Tyszka, <a href="http://arxiv.org/abs/0901.2093">A hypothetical upper bound for the solutions of a Diophantine equation with a finite number of solutions</a>, arXiv:0901.2093 [math.NT], 2009-2014.

%e For n = 16 the smallest solution is 16 = (-511)^3 + (-1609)^3 + 1626^3, which gives the term 1626.

%e 42 = 12602123297335631^3 + 80435758145817515^3 + (-80538738812075974)^3 was found by Andrew Booker and Andrew Sutherland.

%e 74 = 66229832190556^3 + 283450105697727^3 + (-284650292555885)^3 was found by Sander Huisman.

%t nmax = 29; A060464 = Select[Range[0, nmax], Mod[#, 9] != 4 && Mod[#, 9] != 5 &]; A060465 = {0, 0, 0, 1, -1, 0, 0, 0, 1, -2, 7, -1, -511, 1, -1, 0, 1, -11, -2901096694, -1, 0, 0, 0, 1}; r[n_, x_] := Reduce[0 <= Abs[x] <= Abs[y] <= Abs[z] && n == x^3 + y^3 + z^3, {y, z}, Integers]; A060467 = Table[z /. ToRules[ Simplify[ r[A060464[[k]], A060465[[k]]] /. C[1] -> 0]], {k, 1, Length[A060464]}] (* _Jean-François Alcover_, Jul 11 2012 *)

%Y Cf. A060464, A060465, A060466.

%K sign,nice,hard

%O 0,5

%A _N. J. A. Sloane_, Apr 10 2001

%E In order to be consistent with A060465, where only primitive solutions are selected, a(18)=2 was replaced with 15584139827, by _Jean-François Alcover_, Jul 11 2012

%E Edited and a(24) added by _M. F. Hasler_, Nov 10 2015

%E a(25) from Tim Browning and further terms added by _Charlie Neder_, Mar 09 2019

%E More terms from _Jinyuan Wang_, Feb 14 2020

%E a(32) corrected by _XU Pingya_, May 11 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)