Find Ramanujan's Taxi Number using JavaScript:

The British mathematician G. H. Hardy once mentioned to the young Indian mathematician Ramanujan that he had ridden in a taxi whose number he considered to be dull. Ramanujan replied that the number was interesting, since it was the smallest (positive) integer that could be written as the sum of two cubes in two different ways.

This HTML document contains a JavaScript program that finds the number of Hardy's taxi along with the next smallest positive integers that are the sum of two cubes in two different ways:

This solution exploits the ability to use a JavaScript object like a Perl hash array. Unfortunately, the program doesn't have a concept of smallest and just happens to find the first twenty or so in order, after that the solutions are generally increasing but will occasionally be slightly out of numerical order.

This programming problem is originally from Chuck Iverson's C Programming class.