|
%I #12 Oct 20 2019 21:51:29
%S 0,2,3,45,48,20,78,124,95,103,62,147,186,36,168,65,60,179,41,146,254,
%T 254,319,346,423,166,297,206,223,164,659,607,840,808,512
%N In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.
%H N. J. A. Sloane, <a href="/A060415/b060415.txt">Table of n, a(n) for n = 1..35</a> (from the web page of Tomás Oliveira e Silva)
%H Tomás Oliveira e Silva, <a href="http://sweet.ua.pt/tos/3x+1.html">Tables</a>
%H <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%Y Cf. A060412, A060413, A060414.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Apr 06 2001; b-file added Nov 27 2007
%E Corrected by _Don Reble_, May 13 2006
|
