cp's OEIS Frontend

A257703 Number of steps from n to 0 using this algorithm: x -> floor(e*x) if x is odd, and x -> floor(x/e) if x is even.

%I A257703 #4 May 06 2015 09:49:32
%S A257703 2,1,3,3,11,2,8,2,4,4,8,4,10,12,14,12,14,3,7,9,13,3,5,3,7,5,9,5,7,9,
%T A257703 11,9,17,5,9,11,13,11,13,13,19,15,17,13,15,13,25,15,23,4,6,8,10,8,14,
%U A257703 10,12,14,16,4,8,4,8,6,8,4,6,8,12,8,10,6,8,10,20
%N A257703 Number of steps from n to 0 using this algorithm:  x -> floor(e*x) if x is odd, and x -> floor(x/e) if x is even.
%H A257703 Clark Kimberling, <a href="/A257703/b257703.txt">Table of n, a(n) for n = 1..10000</a>
%e A257703 5->13->35->95->258->94->34->12->4->1->2->0, total of 11 steps, so that a(5) = 11.
%t A257703 r = E; f[x_] := If[OddQ[x], Floor[r *x], Floor[x/r]]
%t A257703 g[x_] := Drop[FixedPointList[f, x], -1];
%t A257703 Table[-1 + Length[g[n]], {n, 1, 200}]
%Y A257703 Cf. A257698-A257702, A257704-A257706.
%K A257703 nonn,easy
%O A257703 1,1
%A A257703 _Clark Kimberling_, May 04 2015