login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133420 Number of steps to reach 1 under repeated applications of the "5x+1" map of A133419, or -1 if 1 is never reached. 4
0, 1, 1, 2, 14, 2, 5, 3, 2, 15, 9, 3, 12, 6, 15, 4, 9, 3, 7, 16, 6, 10, 21, 4, 9, 13, 3, 7, 18, 16, 16, 5, 10, 10, 14, 4, 19, 8, 13, 17, 13, 7, 7, 11, 16, 22, 26, 5, 16, 10, 10, 14, 25, 4, 25, 8, 8, 19, 23, 17, 13, 17, 7, 6, 17, 11, 11, 11, 22, 15, 26, 5, 16, 20, 10, 9, 20, 14, 14, 18, 4, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
The 5x+1 map sends x to x/2 if x is even, x/3 if x is divisible by 3, otherwise 5x+1.
LINKS
Tomás Oliveira e Silva, The px+1 problem
CROSSREFS
Cf. A133419.
Sequence in context: A196815 A260120 A221234 * A227628 A298800 A138907
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 18:39 EST 2023. Contains 367563 sequences. (Running on oeis4.)