cp's OEIS Frontend

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.

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