A060415 In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.

0, 2, 3, 45, 48, 20, 78, 124, 95, 103, 62, 147, 186, 36, 168, 65, 60, 179, 41, 146, 254, 254, 319, 346, 423, 166, 297, 206, 223, 164, 659, 607, 840, 808, 512

Offset

1,2

Links

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

Tomás Oliveira e Silva, Tables

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

Crossrefs

Cf. A060412, A060413, A060414.

Sequence in context: A323619 A349559 A349827 * A289661 A191996 A171079

Adjacent sequences: A060412 A060413 A060414 * A060416 A060417 A060418

Keyword

nonn

Author

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

Extensions

Corrected by Don Reble, May 13 2006

Status

approved