login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A273594
Least number k such that abs(A011541(n+1) - A011541(n)*k^3) is a minimum.
0
9, 37, 43, 19, 79
OFFSET
1,1
COMMENTS
If b is the sum of two positive cubes in exactly n ways, then b*c^3 is the sum of two positive cubes in at least n ways for all c > 0. So A011541(i)*c^3 is a candidate for unknown Taxi-cab numbers. a(6) = 79 is an interesting example that is related to this case. Additionally, the benefit of this simple fact is the determination of upper bounds for unknown Taxi-cab numbers in relatively easy way.
The inequalities that are given in the comment section of A011541 are:
A011541(7) <= 101^3*A011541(6),
A011541(8) <= 127^3*A011541(7),
A011541(9) <= 139^3*A011541(8).
So a(6) <= 101, a(7) <= 127, a(8) <= 139.
EXAMPLE
a(5) = 79 because abs(A011541(6) - A011541(5)*79^3) = abs(24153319581254312065344 - 48988659276962496*79^3) = 0
CROSSREFS
Cf. A011541.
Sequence in context: A274769 A126914 A337238 * A041150 A042021 A372752
KEYWORD
nonn,hard,more
AUTHOR
Altug Alkan, May 26 2016
STATUS
approved