%I #10 Sep 25 2023 09:04:39
%S 1,5,11,13,70,278,319,329,349,374,384,416,429,592,966,1134,1404
%N In the Collatz problem, total stopping times for iteration of the 3x+1 function corresponding to the starting points given by A248037.
%C The 3x+1 function (A014682), denoted by T(x) in the literature, is defined as T(x) = (3x+1)/2 if x is odd, T(x) = x/2 if x is even.
%C The total stopping time is the number of iterations of the T(x) map required to reach 1.
%C Except for a(1), these values are listed in the third column of Table 1 in Kontorovich and Lagarias (2009, 2010).
%C See A365503 for corresponding number of odd iterates before reaching 1.
%H Alex V. Kontorovich and Jeffrey C. Lagarias, <a href="https://arxiv.org/abs/0910.1944">Stochastic Models for the 3x+1 and 5x+1 Problems</a>, arXiv:0910.1944 [math.NT], 2009, pp. 9-11, and in Jeffrey C. Lagarias, ed., <a href="http://www.ams.org/bookstore-getitem/item=mbk-78">The Ultimate Challenge: The 3x+1 Problem</a>, American Mathematical Society, 2010, pp. 138-140.
%H <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%F a(n) = A006666(A248037(n)).
%Y Subsequence of A006666.
%Y Cf. A014682, A248037, A365503.
%K nonn,hard,more
%O 1,2
%A _Paolo Xausa_, Sep 06 2023
|