

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) <> 4; a(n) <> 4; a(n) <> 6 for n > 3;


LINKS



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



KEYWORD

nonn


AUTHOR



STATUS

approved



