Cabtaxi number
From Wikipedia, the free encyclopedia
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 9 are known (sequence A047696 in OEIS):
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.