The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216059 Smallest number not in Collatz trajectory starting at n. 5
 2, 3, 6, 3, 3, 7, 3, 3, 3, 3, 3, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) <= 7; a(A007283(n)) = 7; a(n) <> 4; a(n) <> 4; a(n) <> 6 for n > 3; a(n) = A216022(n) + 1. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 Eric Weisstein's World of Mathematics, Collatz Problem Wikipedia, Collatz conjecture Index entries for sequences related to 3x+1 (or Collatz) problem MATHEMATICA scoll[n_]:=Sort[NestWhileList[If[EvenQ[#], #/2, 3#+1] &, n, #>1 &]]; Join[{2, 3}, Table[i=1; While[scoll[n][[i]]==i, i++]; i, {n, 3, 86}]] (* Jayanta Basu, May 27 2013 *) PROG (Haskell) import Data.List ((\\)) a216059 n = head \$ enumFromTo 1 (maximum ts + 1) \\ ts where ts = a070165_row n CROSSREFS Cf. A006370, A070165. Sequence in context: A322229 A245886 A224504 * A261814 A240965 A084228 Adjacent sequences: A216056 A216057 A216058 * A216060 A216061 A216062 KEYWORD nonn AUTHOR Reinhard Zumkeller, Sep 01 2012 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.

Last modified May 23 14:50 EDT 2024. Contains 372763 sequences. (Running on oeis4.)