a(n) is the smallest integer that takes n halving and tripling steps to reach 1 in the 3x+1 problem.

A033491

a(n) is the smallest integer that takes n halving and tripling steps to reach 1 in the 3x+1 problem.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =8a(4) =16a(5) =5a(6) =10a(7) =3a(8) =6a(9) =12a(10) =24a(11) =48a(12) =17a(13) =34a(14) =11a(15) =22a(16) =7a(17) =14a(18) =28a(19) =9a(20) =18a(21) =36a(22) =72a(23) =25a(24) =49a(25) =98a(26) =33a(27) =65a(28) =130a(29) =43

External references