A365503 In the Collatz (3x+1) problem, number of odd iterates before reaching 1 corresponding to the starting points given by A248037.

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

Table of n, a(n) for n=1..17.

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.

Index entries for sequences related to 3x+1 (or Collatz) problem

Formula

a(n) = A006667(A248037(n)).

Crossrefs

Subsequence of A006667.

Cf. A014682, A248037, A365502.

Sequence in context: A360085 A152918 A276845 * A055877 A288799 A281378

Adjacent sequences: A365500 A365501 A365502 * A365504 A365505 A365506

Keyword

nonn,hard,more

Author

Paolo Xausa, Sep 06 2023

Status

approved