A <ahref="https://en.wikipedia.org/wiki/Hardy–Ramanujan number"title="wp: Hardy–Ramanujan number">taxicab number</a>
(the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
The first taxicab number is 1729, which is:
1<sup>3</sup> + 12<sup>3</sup> and
9<sup>3</sup> + 10<sup>3</sup>.
Taxicab numbers are also known as:
* taxi numbers
* taxi-cab numbers
* taxi cab numbers
* Hardy-Ramanujan numbers
Task:
Write a function that returns the lowest N taxicab numbers.
For each of the taxicab numbers, show the number as well as it's constituent cubes.
See also:
[http://oeis.org/A001235 A001235 taxicab numbers] on The On-Line Encyclopedia of Integer Sequences.
<ahref="http://mathworld.wolfram.com/Hardy-RamanujanNumber.html">Hardy-Ramanujan Number</a> on MathWorld.
<ahref="http://mathworld.wolfram.com/TaxicabNumber.html">taxicab number</a> on MathWorld.
<ahref="https://en.wikipedia.org/wiki/Taxicab_number">taxicab number</a> on Wikipedia.
- text: taxicabNumbers(39) resulting numbers from 20 - 29 should be [314496,320264,327763,373464,402597,439101,443889,513000,513856].
testString: assert.deepEqual(taxicabNumbers(39).slice(20, 29), res39From20To29, 'taxicabNumbers(39) resulting numbers from 20 - 29 should be [314496,320264,327763,373464,402597,439101,443889,513000,513856].');