Just click the flag. The Hailstone Conundrum is a pattern where all numbers go to one through a sequence, but if a number can be proven that it does not go to one, it is an important exception and should be put into the comments. Unfortunately scratch cannot handle numbers this large, so I may be doing it on a more powerful website or app in a different coding language.
If a number doesn't ever become one I will look at it. The below code will repeat until the red octagon is clicked: x variable increases by 1. n is set to x (the code below will repeat until n becomes 1) n is even: n b n is odd: n becomes triple n plus 1 10000 numbers per 30 seconds is equal to 1,200,000 numbers per hour.
