A060411 In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives iterate where maximal value is reached in the trajectory with that start.

0, 2, 3, 4, 45, 8, 31, 14, 48, 28, 49, 33, 26, 50, 35, 43, 67, 39, 69, 39, 35, 124, 83, 37, 132, 46, 81, 75, 83, 118, 68, 42, 72, 97, 98, 75, 92, 199, 109, 92, 92, 160, 91, 197, 119, 113, 109, 124, 176, 217, 234, 276, 172, 164, 233, 101, 109, 158, 157

Offset

1,2

Links

N. J. A. Sloane, Table of n, a(n) for n = 1..88 (from the web page of Tomás Oliveira e Silva)

Tomás Oliveira e Silva, Tables (gives many more terms)

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

Crossrefs

Cf. A006884, A060409, A060410.

Sequence in context: A134305 A000033 A270350 * A037322 A037429 A230452

Adjacent sequences: A060408 A060409 A060410 * A060412 A060413 A060414

Keyword

nonn

Author

N. J. A. Sloane, Apr 06 2001; b-file added Nov 27 2007

Status

approved