|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|