%I A060411
%S A060411 0,2,3,4,45,8,31,14,48,28,49,33,26,50,35,43,67,39,69,39,35,124,83,
%T A060411 37,132,46,81,75,83,118,68,42,72,97,98,75,92,199,109,92,92,160,91,
%U A060411 197,119,113,109,124,176,217,234,276,172,164,233,101,109,158,157
%N A060411 In the `3x+1' problem, take the sequence of starting values which set 
               new records for the highest point of the trajectory before reaching 
               1 (A006884); sequence gives iterate where maximal value is reached 
               in the trajectory with that start.
%H A060411 N. J. A. Sloane, <a href="b060411.txt">Table of n, a(n) for n=1..88</
               a> (from the web page of Tomas Oliveira e Silva)
%H A060411 Tomas Oliveira e Silva, <a href="http://www.ieeta.pt/~tos/3x+1.html">
               Tables</a> (gives many more terms)
%H A060411 <a href="Sindx_3.html#3x1">Index entries for sequences related to 3x+1 
               (or Collatz) problem</a>
%Y A060411 Cf. A006884, A060409, A060410.
%Y A060411 Sequence in context: A024634 A134305 A000033 this_sequence A037322 A037429 
               A023167
%Y A060411 Adjacent sequences: A060408 A060409 A060410 this_sequence A060412 A060413 
               A060414
%K A060411 nonn
%O A060411 1,2
%A A060411 N. J. A. Sloane (njas(AT)research.att.com), Apr 06 2001; b-file added 
               Nov 27 2007