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 have a total submission count of 1,735,375, and 1,582,332 of those submissions are unique. The greatest number of steps I've seen from a single submitted number so far is 62,118 (abiding by the 500 digit restriction) and was found on 18/01/2015. The most popular submitted number has been submitted 12,050 times. The second-most popular submitted number has been submitted 322 times. The total maximum amount of digits (all steps end-to-end) produced from a single submitted number is 15,813,021. The grand total number of steps produced by this tool is 547,607,373, or 462,385,451 for only unique submissions. This means a staggering grand total number of 40,217,412,202 digits were generated, or 25,730,820,865 digits if we count only unique submissions (these include step #0 and the final result of 1). Those big numbers equate to 37.46 GiBs and 23.96 GiBs of data respectively. The last submission (not unique) happened this immediate second.
These statistics began recording back in July, 2012.