A257698 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 = 3/2.

0, 1, 3, 2, 6, 3, 5, 7, 13, 4, 6, 8, 12, 14, 16, 5, 13, 9, 11, 13, 17, 15, 17, 6, 12, 14, 16, 10, 14, 14, 16, 18, 28, 16, 18, 7, 11, 13, 15, 15, 21, 11, 13, 15, 19, 15, 17, 19, 27, 29, 31, 17, 21, 8, 10, 12, 18, 14, 16, 16, 20, 22, 24, 12, 24, 16, 18, 20, 24

Offset

1,3

Links

Clark Kimberling, Table of n, a(n) for n = 1..10000

Example

5->7->10->6->4->2->1, total of 6 steps, so that a(5) = 6.

Mathematica

r = 3/2; 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

Cf. A257699-A257706.

Sequence in context: A137324 A011209 A182649 * A364384 A322907 A071018

Adjacent sequences: A257695 A257696 A257697 * A257699 A257700 A257701

Keyword

nonn,easy

Author

Clark Kimberling, May 04 2015

Status

approved