I made a new Python program that calculates numbers for the Collatz Conjecture.
Essentially it takes a number and if the number is odd you multiply it by 3 and add, 1 hence the name 3x+1, if it is even you divide the number by 2. Once it reaches 1 it gets in a loop (4,2,1,4,2,1), the numbers are considered to end when the reach one. Any time it is odd and you calculate 3x+1, it becomes an odd number. Some odd numbers divided by 2 become even others stay odd.

The conjecture became very famous due to the inability to prove that every number reaches one. Some numbers climb very high, for example 27 itâ€™s highest number is 9232.

Paul ErdĹ‘s said about the Collatz conjecture: â€śMathematics may not be ready for such problems.â€ť[7]Jeffrey Lagarias stated in 2010 that the Collatz conjecture â€śis an extraordinarily difficult problem, completely out of reach of present day mathematicsâ€ť.[8]

Thereâ€™s only a few loops discovered, 3 for negative numbers, 1 for positive.
Storing all of the sequences of numbers probably takes a lot of memory and the program currently only does one calculation (it should allow more in one session though).