login
A365503
In the Collatz (3x+1) problem, number of odd iterates before reaching 1 corresponding to the starting points given by A248037.
1
0, 2, 5, 6, 41, 164, 189, 195, 207, 222, 228, 248, 256, 357, 583, 686, 850
OFFSET
1,2
COMMENTS
Except for a(1), these values are listed in the fourth column of Table 1 in Kontorovich and Lagarias (2009, 2010).
See A365502 for corresponding total stopping times.
LINKS
Alex V. Kontorovich and Jeffrey C. Lagarias, Stochastic Models for the 3x+1 and 5x+1 Problems, arXiv:0910.1944 [math.NT], 2009, pp. 9-11, and in Jeffrey C. Lagarias, ed., The Ultimate Challenge: The 3x+1 Problem, American Mathematical Society, 2010, pp. 138-140.
FORMULA
a(n) = A006667(A248037(n)).
CROSSREFS
Subsequence of A006667.
Sequence in context: A360085 A152918 A276845 * A055877 A288799 A281378
KEYWORD
nonn,hard,more
AUTHOR
Paolo Xausa, Sep 06 2023
STATUS
approved