login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060409 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 associated "dropping time", number of steps to reach a lower value than the start. 4
1, 4, 7, 7, 59, 13, 40, 23, 81, 61, 70, 65, 54, 72, 65, 59, 127, 105, 110, 59, 72, 164, 140, 73, 170, 105, 149, 97, 135, 183, 99, 99, 124, 156, 200, 140, 222, 264, 181, 243, 203, 238, 262, 362, 249, 183, 238, 226, 243, 294, 375, 455, 292, 245, 414 (list; graph; refs; listen; history; text; internal format)
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, A060410, A060411.

Sequence in context: A271919 A201125 A154922 * A171548 A198822 A275977

Adjacent sequences:  A060406 A060407 A060408 * A060410 A060411 A060412

KEYWORD

nonn

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 23 17:50 EDT 2017. Contains 292363 sequences.