The solution must be a lookup table since the 6th taxicab number is already greater than 2^64. If anyone find an algorithm for this, DO NOT publish here, publish a scientific paper. Researchers published a paper just about the upper bounds for the 7th to12th number for instance.
The 6th taxicab number is not even a certainty apparently http://jucs.org/jucs_9_10/what_is_the_value/Calude_C_S.pdf
not a general solution
Considering that the proof of the 6th taxicab number produced over 8GB of data and consisted of an exhaustive search over the integers up to 1e21, a truly generic solution is not really possible.
Return the 3n+1 sequence for n
Volume of a Parallelepiped
Permute diagonal and antidiagonal
Min of a Matrix
all possible subsets of set
remove single elements
longest common substring : Skipped character version
Largest Geometric Series
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office