cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

0, 2, 5, 6, 41, 164, 189, 195, 207, 222, 228, 248, 256, 357, 583, 686, 850
Offset: 1

Views

Author

Paolo Xausa, Sep 06 2023

Keywords

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

Crossrefs

Subsequence of A006667.
Cf. A014682, A248037, A365502.

Formula

a(n) = A006667(A248037(n)).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.