login
In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated dropping times.
6

%I #12 Oct 20 2019 21:49:25

%S 1,4,7,59,81,105,135,164,165,173,176,183,224,246,287,292,298,308,376,

%T 395,398,433,447,547,550,606,688,712,722,728,886,902,966,990,1005

%N In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated dropping times.

%H N. J. A. Sloane, <a href="/A060413/b060413.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. A126241, A060412.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Apr 06 2001; b-file added Nov 27 2007