title: Finding taxicab Numbers
body: <p>Find the first <code>n</code> taxicab numbers. Given a value <code>n</code>. I would like to find the first n taxicab numbers.
  A taxicab being a number that can be expressed as the sum of two perfect cubes in more than one way.</p>
  
  <blockquote>
    <p>(Note that there are two <strong>related but different</strong> sets referred to as
    'taxicab numbers': the <a href="http://oeis.org/A001235" rel="nofollow">sums of 2 cubes in <strong>more than 1</strong>
    way</a>, and <a href="http://oeis.org/A011541" rel="nofollow">the smallest numbers that are the
    sum of 2 positive integral cubes in <strong><code>n</code></strong>
    ways</a>. This question is about the former set,
    since the latter set has only the first six members known)</p>
  </blockquote>
  
  <p>For example: </p>
  
  <pre><code>1^3 + 12^3 = 1729 = 9^3 + 10^3
  </code></pre>
  
  <p>I would like a rough overview of the algorithm or the C snippet of how to approach the problem.</p>
  
  <pre><code>The first five of these are:
  
     I    J      K    L      Number 
  ---------------------------------
     1   12      9   10      1729       
     2   16      9   15      4104      
     2   24     18   20     13832       
    10   27     19   24     20683      
     4   32     18   30     32832    
  </code></pre>