login
A257700
Number of steps from n to 1 using this algorithm: x -> floor(r*x) if x is odd, and x -> floor(x/r) if x is even, where r = 5/3.
3
0, 1, 5, 2, 4, 6, 10, 3, 11, 7, 9, 11, 17, 4, 10, 12, 14, 8, 26, 12, 16, 18, 20, 5, 9, 11, 19, 13, 15, 9, 25, 27, 37, 13, 15, 17, 23, 19, 23, 6, 8, 10, 14, 12, 18, 20, 22, 14, 32, 10, 24, 26, 28, 28, 36, 38, 42, 14, 16, 18, 22, 24, 34, 20, 22, 24, 30, 7, 13
OFFSET
1,3
LINKS
EXAMPLE
5->8->4->2->1, total of 4 steps, so that a(5) = 4.
MATHEMATICA
r = 5/3; f[x_] := If[OddQ[x], Floor[r *x], Floor[x/r]]
g[x_] := Drop[FixedPointList[f, x], -1];
Table[-1 + Length[g[n]], {n, 1, 200}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 04 2015
STATUS
approved