Dropping time for the 3x+1 problem: for n >= 2, number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated starting at n; a(1)=1 by convention.
A074473
Dropping time for the 3x+1 problem: for n >= 2, number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated starting at n; a(1)=1 by convention.
Terms
- a(0) =1a(1) =2a(2) =7a(3) =2a(4) =4a(5) =2a(6) =12a(7) =2a(8) =4a(9) =2a(10) =9a(11) =2a(12) =4a(13) =2a(14) =12a(15) =2a(16) =4a(17) =2a(18) =7a(19) =2a(20) =4a(21) =2a(22) =9a(23) =2a(24) =4a(25) =2a(26) =97a(27) =2a(28) =4a(29) =2
External references
- oeis: A074473