|
| |
|
|
A047696
|
|
Smallest positive number that can be written in n ways as a sum of two (not necessarily positive) cubes.
|
|
3
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Sometimes called cab-taxi (or cabtaxi) numbers.
Christian Boyer: After his recent work on Taxicab(6) confirming the number found as an upper bound by Randall Rathbun in 2002, Uwe Hollerbach (USA) confirmed this week that my upper bound constructed in Dec 2006 is really Cabtaxi(10). See his announcement. - Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 08 2008
|
|
|
REFERENCES
| C. Boyer, "Les nombres Taxicabs", in Dossier Pour La Science, pp. 26-28, Volume 59 (Jeux math') April/June 2008 Paris.
R. K. Guy, Unsolved Problems in Number Theory, Section D1.
|
|
|
LINKS
| D. J. Bernstein, Enumerating solutions to p(a) + q(b) = r(c) + s(d)
D. J. Bernstein, Enumerating solutions to p(a) + q(b) = r(c) + s(d)
C. Boyer, New upper bounds on Taxicab and Cabtaxi numbers
Uwe Hollerbach, The tenth cabtaxi number is 933528127886302221000, May 14, 2008.
Eric Weisstein's World of Mathematics, Taxicab Numbers
Eric Weisstein's World of Mathematics, Cabtaxi Number
Wikipedia, Cabtaxi number
|
|
|
EXAMPLE
| 91 = 6^3 - 5^3 = 4^3 + 3^3 (in two ways).
Cabtaxi(9)=424910390480793000 = 645210^3 + 538680^3 = 649565^3 + 532315^3 = 752409^3 - 101409^3 = 759780^3 - 239190^3 = 773850^3 - 337680^3 = 834820^3 - 539350^3 = 1417050^3 - 1342680^3 = 3179820^3 - 3165750^3 = 5960010^3 - 5956020^3.
|
|
|
CROSSREFS
| Cf. A011541, A047697.
Cf. A011541, A047697.
Sequence in context: A165220 A020218 A084319 * A043459 A038488 A072393
Adjacent sequences: A047693 A047694 A047695 * A047697 A047698 A047699
|
|
|
KEYWORD
| nonn,nice,hard
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| a(9) from Duncan Moore (Duncan.Moore(AT)nnc.co.uk), Feb 01 2005. This term was found on Jan 31 2005.
For a(10), see the C. Boyer link.
|
| |
|
|
