Cubes, the Cabtaxi Number Fleet

A taxicab number is the smallest integer that is the sum of two positive cubes from n different sums. So there's one taxicab number for n = 1, 2, 3. . . A cabtaxi number is the smallest positive integer that is the sum of two positive or negative integers from n different sums. (See Wikipedia or Wolfram.) Only nine cabtaxi numbers are known, though more are supposed to exist even though they haven't been found yet. All but the first three are seven digits or more. It occurs to me that the numbers for real taxicabs should be just a few digits — more than one, but less than seven certainly. So I think it would be interesting to find all the two, three, or four digit candidates for cabtaxi numbers (the cabtaxi fleet) , and it shouldn't matter whether they're the smallest integer for n sums.

Therefore, a cabtaxi candidate is like a cabtaxi number except that it may not be the smallest integer; and, for this project I'll say that it should be from 2 to 4 digits. This set of cabtaxi candidates would include Cabtaxi(2) and Cabtaxi(3) — 91, 728 — as well as the taxicab number, 1729, which is Taxicab(2).

Here are a few of the candidates in the cabtaxi fleet, but probably not all:
91 = 6³ – 5³ = 3³ + 4³, Cabtaxi(2)
152 = 6³ – 4³ = 3³ + 5³
189 = 6³ – 3³ = 4³ + 5³
217 = 9³ – 8³ = 6³ + 1³
513 = 9³ – 6³ = 8³ + 1³
721 = 9³ – 2³ = 16³ – 15³
728 = 9³ – 1³ = 12³ – 10³ = 6³ + 8³, Cabtaxi(3)
1027 = 19³ – 18³ = 10³ + 3³
1729 = 1³ + 12³ = 9³ + 10³, Taxicab(2)
1736 = 18³ – 16³ = 12³ + 2³
3367 = 16³ – 9³ = 34³ – 33³
4104 = 18³ – 12³ = 15³ + 9³ = 16³ + 2³
5824 = 18³ – 2³ = 24³ – 20³
5859 = 19³ – 10³ = 27³ – 24³
7922 = 20³ – 2³ = 24³ – 18³
8216 = 38³ – 36³ = 20³ + 6³
8587 = 54³ – 53³ = 19³ + 12³

From this we should be able to develop a way to use cabtaxi candidates graphically, similar to the coprimes plots.

Two ways to look at Cabtaxi(2):