The Collatz conjecture, named after Lothar Collatz of Germany, proposed the conjecture in 1937. The conjecture states you must begin with any positive integer n: If it is an even number then halve it, or if it is an odd number then triple it and add 1. Do this recursively, and your result should always reach 1.
Please note: A maximum input length of 500 digits is enforced. Everything except positive numbers will be stripped out (including plus and minus signs) and must equal 1 or above. By entering ridiculously large numbers, the resulting page may be a few megabytes big.Information
Main article: Collatz Conjecture - Information
It has long been undecided if the first step should or should not include the starting integer. Many documents state this uncertainty on the Internet. I'm following the OEIS examples A006577 and A008884. On my page, I shall use step 0 to show the starting integer.
I thought it might be interesting to some to include statistics about the data generated by use of this tool.
I've seen 1,422,765 unique starting integers. I have a total submission count of 1,501,105. The greatest number of steps I've seen from a submitted starting integer is 62,118 so far (abiding by the 500 digit length limitation) and was found on 18/01/2015. The most popular submitted starting integer has been submitted 20,396 times. The grand total number of steps produced by this tool is 315,702,225. This means a staggering grand total number of 6,024,870,896 digits were generated (including step #0 and the final result of 1), that equates to 5.61 GiBs of data.
These statistics began recording back in July, 2012.