|
%I #5 May 06 2015 09:48:57
%S 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,
%T 10,14,14,16,18,28,16,18,7,11,13,15,15,21,11,13,15,19,15,17,19,27,29,
%U 31,17,21,8,10,12,18,14,16,16,20,22,24,12,24,16,18,20,24
%N 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.
%H Clark Kimberling, <a href="/A257698/b257698.txt">Table of n, a(n) for n = 1..10000</a>
%e 5->7->10->6->4->2->1, total of 6 steps, so that a(5) = 6.
%t r = 3/2; f[x_] := If[OddQ[x], Floor[r *x], Floor[x/r]]
%t g[x_] := Drop[FixedPointList[f, x], -1];
%t Table[-1 + Length[g[n]], {n, 1, 200}]
%Y Cf. A257699-A257706.
%K nonn,easy
%O 1,3
%A _Clark Kimberling_, May 04 2015
|
