In mathematics, the "n"-th cabtaxi number, typically denoted Cabtaxi("n"), is defined as the smallest positive integer that can be written as the sum of two "positive or negative or 0" cubes in "n" ways. Such numbers exist for all "n" (since taxicab numbers exist for all "n"); however, only 10 are known OEIS|id=A047696:
:
:
:
:
:
:
:
:
:
:
Cabtaxi(5), Cabtaxi(6) and Cabtaxi(7) were found by Randall L. Rathbun; Cabtaxi(8) was found by Daniel J. Bernstein; Cabtaxi(9) was found by Duncan Moore, using Bernstein's method. Cabtaxi(10) was first reported by Christian Boyer in 2006 and verified as Cabtaxi(10) by Uwe Hollerbach and reported on the NMBRTHRY mailing list on May 16 2008.
See also
* Taxicab number
* Generalized taxicab number
External links
* [http://listserv.nodak.edu/cgi-bin/wa.exe?A2=ind0502&L=nmbrthry&F=&S=&P=55 Announcement of Cabtaxi(9)]
* [http://listserv.nodak.edu/cgi-bin/wa.exe?A2=ind0805&L=nmbrthry&T=0&P=1284 Announcement of Cabtaxi(10)]
* [http://euler.free.fr/ Cabtaxi at Euler]