login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A270570
Largest number in the sequence for the Collatz problem (excluding the original number) when started at n.
2
1, 16, 2, 16, 16, 52, 4, 52, 16, 52, 16, 40, 52, 160, 8, 52, 52, 88, 16, 64, 52, 160, 16, 88, 40, 9232, 52, 88, 160, 9232, 16, 100, 52, 160, 52, 112, 88, 304, 20, 9232, 64, 196, 52, 136, 160, 9232, 24, 148, 88, 232, 40, 160, 9232, 9232, 52, 196, 88, 304, 160
OFFSET
2,2
LINKS
EXAMPLE
For n = 7, the sequence is: 7, 22, 11, 34, 17, *52*, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. The highest value in the list (starred) is 52.
MATHEMATICA
Table[k = n; maxk = 0; While[k ≠ 1, If[EvenQ[k], k = k/2, k = 3*k + 1]; maxk = Max[maxk, k]]; maxk, {n, 2, 100}] (* Robert Price, Apr 11 2016 *)
CROSSREFS
Sequence in context: A285386 A100079 A144532 * A040255 A031323 A095838
KEYWORD
nonn
AUTHOR
Douglas Boffey, Mar 19 2016
STATUS
approved