For any n > 0, if A006666(n) >= 0, then a(n) = Sum_{i = 0..A006666(n)-1} 2^i * [T^i(n) == 0 (mod 2)] (where [] is an Iverson bracket and T^i denotes the i-th iterate of the Collatz function A014682); otherwise a(n) = -1.

A304715

For any n > 0, if A006666(n) >= 0, then a(n) = Sum_{i = 0..A006666(n)-1} 2^i * [T^i(n) == 0 (mod 2)] (where [] is an Iverson bracket and T^i denotes the i-th iterate of the Collatz function A014682); otherwise a(n) = -1.

Terms

    a(0) =0a(1) =1a(2) =28a(3) =3a(4) =14a(5) =57a(6) =1896a(7) =7a(8) =7586a(9) =29a(10) =948a(11) =115a(12) =118a(13) =3793a(14) =3824a(15) =15a(16) =474a(17) =15173a(18) =15180a(19) =59a(20) =62a(21) =1897a(22) =1912a(23) =231a(24) =60722a(25) =237a(27) =7587a(28) =7590a(29) =7649a(31) =31

External references