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-2 of 2 results.

A365502 In the Collatz problem, total stopping times for iteration of the 3x+1 function corresponding to the starting points given by A248037.

Original entry on oeis.org

1, 5, 11, 13, 70, 278, 319, 329, 349, 374, 384, 416, 429, 592, 966, 1134, 1404
Offset: 1

Views

Author

Paolo Xausa, Sep 06 2023

Keywords

Comments

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.
The total stopping time is the number of iterations of the T(x) map required to reach 1.
Except for a(1), these values are listed in the third column of Table 1 in Kontorovich and Lagarias (2009, 2010).
See A365503 for corresponding number of odd iterates before reaching 1.

Links

Crossrefs

Subsequence of A006666.
Cf. A014682, A248037, A365503.

Formula

a(n) = A006666(A248037(n)).

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-2 of 2 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.