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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060414 In the `3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated maximal value reached in the trajectory with that start. 3
2, 8, 26, 4616, 125252, 1242458, 20581856, 12324038948, 282667562, 282667562, 3611141594, 8904120362, 45119577824, 8077577336, 795853127168, 44621605808, 1848429310544, 3604523133626, 483308017730 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

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 (gives many more terms)

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

CROSSREFS

Sequence in context: A130613 A143338 A027267 * A087241 A184628 A092071

Adjacent sequences:  A060411 A060412 A060413 * A060415 A060416 A060417

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 21:56 EST 2012. Contains 205860 sequences.