The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206643 Number of halving and tripling steps to reach 1 in 3x+1 problem applied the Fibonacci numbers. 1
 0, 0, 1, 7, 5, 3, 9, 7, 13, 112, 30, 23, 83, 63, 38, 36, 122, 102, 33, 137, 161, 79, 103, 145, 112, 180, 129, 246, 102, 131, 186, 135, 128, 245, 119, 112, 273, 240, 127, 244, 299, 191, 290, 363, 188, 199, 272, 203, 276, 225, 205, 273, 253, 308, 363, 361, 473 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Michel Lagneau, Table of n, a(n) for n = 1..2000 EXAMPLE a(4) = 7 because Fibonacci(4) = 3, and A006577(3) = 7. MATHEMATICA f[n_] := Module[{a=Fibonacci[n], k=0}, While[a!=1, k++; If[EvenQ[a], a=a/2, a=a*3+1]]; k]; Table[f[n], {n, 100}] CROSSREFS Cf. A006577, A000045. Sequence in context: A255646 A255196 A345736 * A257499 A144846 A090289 Adjacent sequences:  A206640 A206641 A206642 * A206644 A206645 A206646 KEYWORD nonn AUTHOR Michel Lagneau, Feb 11 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 26 20:17 EDT 2021. Contains 346294 sequences. (Running on oeis4.)