Cabtaxi number
In mathematics, the n-th cabtaxi number, typically denoted Cabtaxi, 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 ; however, only 10 are known :
Cabtaxi, Cabtaxi and Cabtaxi were found by Randall L. Rathbun; Cabtaxi was found by Daniel J. Bernstein; Cabtaxi was found by Duncan Moore, using Bernstein's method. Cabtaxi was first reported as an upper bound by Christian Boyer in 2006 and verified as Cabtaxi by Uwe Hollerbach and reported on the NMBRTHRY mailing list on May 16, 2008.
