%I A160266
%S A160266 2,1,1,2,4,2,1,1,6,1,2,1,1,5,1,1,1,6,1,4,3,1,2,1,1,2,1,1,10,5,1,1,8,1,
               1,
%T A160266 1,1,1,2,1
%N A160266 Let f be defined as in A159885. Then a(n) is the least k for which A006694((f^k(2n+1)-1)/
               2)<A006694(n), where f^k is the k-th iteration of f.
%C A160266 Conjecture. For every n>=1, there exists a finite value of a(n). It is 
               easy to see that this conjecture is equivalent to the well known 
               Collatz 3n+1 conjecture.
%Y A160266 A006694 A159885 A159945 A160198 A122458
%Y A160266 Sequence in context: A133771 A127309 A097853 this_sequence A023504 A157905 
               A027113
%Y A160266 Adjacent sequences: A160263 A160264 A160265 this_sequence A160267 A160268 
               A160269
%K A160266 nonn,uned
%O A160266 1,1
%A A160266 Vladimir Shevelev (shevelev(AT)bgu.ac.il), May 07 2009