Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.
A060322
Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =4a(7) =5a(8) =6a(9) =8a(10) =12a(11) =18a(12) =24a(13) =31a(14) =39a(15) =50a(16) =68a(17) =91a(18) =120a(19) =159a(20) =211a(21) =282a(22) =381a(23) =505a(24) =665a(25) =885a(26) =1187a(27) =1590a(28) =2122a(29) =2829
External references
- oeis: A060322