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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A159945 Let f be defined as in A159885. Then a(n) = max{A000120(f^i(2n+1)): 1 <= i <= A159885(n)}. 10
 2, 1, 3, 3, 2, 2, 4, 3, 4, 1, 3, 4, 3, 3, 5, 4, 4, 3, 5, 8, 2, 2, 4, 3, 4, 2, 4, 4, 4, 4, 6, 3, 4, 3, 5, 8, 4, 4, 6, 5, 6, 1, 3, 3, 3, 3, 5, 8, 4, 3, 6, 6, 3, 3, 5, 4, 5, 3, 5, 5, 5, 5, 7, 8, 4, 4, 5, 8, 5, 4, 6, 8, 6, 3, 5, 5, 6, 5, 7, 8, 6, 5, 8, 7, 2, 2, 4, 3, 4, 2, 4, 4, 4, 4, 6, 8, 6, 3, 5, 5, 4, 4, 7, 5, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Problem: find an upper estimate for a(n). LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 Index entries for sequences related to 3x+1 (or Collatz) problem PROG (PARI) A006519(n) = (1<

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 August 15 16:21 EDT 2024. Contains 375173 sequences. (Running on oeis4.)