a(1)=1; a(n+1) is the smallest integer > a(n) such that C_2k(a(n+1))=C_2k(a(n)) for k large enough, where C_m(n) is the modified Collatz map iterated m times on n ( x->x/2 if x is even x->(3x+1)/2 if x is odd).

A076138

a(1)=1; a(n+1) is the smallest integer > a(n) such that C_2k(a(n+1))=C_2k(a(n)) for k large enough, where C_m(n) is the modified Collatz map iterated m times on n ( x->x/2 if x is even x->(3x+1)/2 if x is odd).

Terms

    a(0) =1a(1) =4a(2) =5a(3) =6a(4) =11a(5) =14a(6) =15a(7) =16a(8) =18a(9) =19a(10) =20a(11) =21a(12) =24a(13) =25a(14) =26a(15) =27a(16) =33a(17) =34a(18) =35a(19) =43a(20) =44a(21) =45a(22) =46a(23) =47a(24) =56a(25) =57a(26) =58a(27) =59a(28) =60a(29) =61

External references