cp's OEIS Frontend

A173515 Consider positive integer solutions to x^3+ y^3 = z^3 - n or 'Fermat near misses' of 1, 2, 3 ... Arrange known solutions by increasing values of n. Sequence gives value of lowest z for a given n.

%I A173515 #27 May 20 2025 23:13:12
%S A173515 9,7,2,812918,18,217,4,3,9730705,332,14,135,3,19,156,16,15584139827,3,
%T A173515 139643,6,1541,4,2220422932,5,14,4,445,12205,9,8,16234,815,31,4
%N A173515 Consider positive integer solutions to x^3+ y^3 = z^3 - n or 'Fermat near misses' of 1, 2, 3 ... Arrange known solutions by increasing values of n. Sequence gives value of lowest z for a given n.
%C A173515 The submitted values are for z when 0 < n < 51. There is no solution for any n congruent to 4 or 5 mod 9. This eliminates 4,5,13,14,22,23,31,32,40,41,49 and 50 in the 0-to-50 range.
%C A173515 Per the Elsenhans and Jahnel link there are no solutions found for 3, 33, 39 and 42 in the 0-to-50 range, with a search bound of 10^14.
%C A173515 If sequences could contain 'nil' for no solution, and '?' for cases where a solution is not known, but might exist, then a more concise definition is possible: Least positive integer such that a(n)^3 - n is the sum of two positive cubes. The sequence would then start: 9, 7, ?, nil, nil, 2.
%H A173515 Andreas-Stephan Elsenhans and Joerg Jahnel, <a href="http://www.uni-math.gwdg.de/jahnel/Arbeiten/Liste/threecubes_20070419.txt">List of solutions of x^3 + y^3 + z^3 = n for n < 1000 neither a cube nor twice a cube</a>
%H A173515 D.R. Heath-Brown, W.M. Lioen and H.J.J. te Riele, <a href="http://euler.free.fr/docs/HLR93.pdf"> on Solving the Diophantine Equation x^3 + y^3 + z^3 = k on a Vector Computer</a>
%H A173515 Kenji Koyama, Yukio Tsuruoka, and Hiroshi 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-851.
%H A173515 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>
%F A173515 Author conjectures that no explicit formula or recurrence exists.
%e A173515 6^3 + 8^3 = 9^3 - 1: There are no solutions when n = 1 for z < 9, thus the first term is 9.
%e A173515 5^3 + 6^3 = 7^3 - 2: There are no solutions for z < 7, thus the second term is 7.
%e A173515 It is unknown if there is a solution when n = 3.
%e A173515 It is known there are no solutions when n = 4 and 5.
%e A173515 1^3 + 1^3 = 2^3 - 6, thus the third term is 2.
%o A173515 (Ruby)
%o A173515 # x^3 + y^3 = z^3 - n
%o A173515 # Solve for all z less than z_limit, and
%o A173515 # n less than n_limit.
%o A173515 # When n = 7, z = 812918 and faster code and language are needed.
%o A173515 # However, by optimizing this code slightly and running for 2 days
%o A173515 # the author was able to search all z < 164000 and n < 100
%o A173515 #
%o A173515 n_limit = 7 # Configure as desired
%o A173515 z_limit = 20 # Configure as desired
%o A173515 h = {}
%o A173515 (2..z_limit).each{ |z|
%o A173515   (1..(z-1)).each{ |y|
%o A173515   (1..(y)).each{ |x|
%o A173515   n = z*z*z - x*x*x - y*y*y
%o A173515   if n > 0 && n < n_limit && h[n].nil?
%o A173515   puts "Found z = #{z} when #{x}^^3 + #{y}^^3 = #{z}^^3 - #{n}"
%o A173515   h[n] = z
%o A173515   end
%o A173515 } } } print "\nPartial sequence generated when n < #{n_limit} and z is searched to #{z_limit} is:\n"
%o A173515 h.sort.each{|k,v| print "#{v}, " }
%o A173515 print "\b\b \n"
%Y A173515 Cf. A050788, A159935.
%K A173515 nonn
%O A173515 1,1
%A A173515 _Andy Martin_, Feb 20 2010