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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060413 In the `3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated dropping times. 5
1, 4, 7, 59, 81, 105, 135, 164, 165, 173, 176, 183, 224, 246, 287, 292, 298, 308, 376, 395, 398, 433, 447, 547, 550, 606, 688, 712, 722, 728, 886, 902, 966, 990, 1005 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

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

Tomas Oliveira e Silva, Tables

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

CROSSREFS

Cf. A126241, A060412.

Sequence in context: A094609 A049191 A013467 * A065674 A072954 A135790

Adjacent sequences:  A060410 A060411 A060412 * A060414 A060415 A060416

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Apr 06 2001; b-file added Nov 27 2007

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

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

Last modified February 15 12:01 EST 2012. Contains 205782 sequences.