Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060411
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
4
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 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research