cp's OEIS Frontend

A258242 Number of steps from n to 0, where allowable steps are x -> [x/r] if x = is in A022838 (the Beatty sequence for sqrt(3)) and x -> [r*x] otherwise, where [ ] = floor and r = sqrt(3).

%I A258242 #4 Jun 07 2015 18:03:50
%S A258242 0,1,3,2,4,4,3,5,5,7,5,7,4,6,8,6,8,8,10,6,8,10,5,7,7,9,11,7,9,9,11,9,
%T A258242 11,13,7,9,9,11,11,6,8,8,10,8,10,10,12,14,8,10,10,10,12,12,14,10,12,
%U A258242 12,14,16,8,10,10,12,10,12,14,12,14,7,9,9,9,11,11
%N A258242 Number of steps from n to 0, where allowable steps are x -> [x/r] if x = is in A022838 (the Beatty sequence for sqrt(3)) and x -> [r*x] otherwise, where [ ] = floor and r = sqrt(3).
%C A258242 a(n) = number of edges from 0 to n in the tree at A258241.
%H A258242 Clark Kimberling, <a href="/A258242/b258242.txt">Table of n, a(n) for n = 0..10000</a>
%e A258242 16->27->15->8->4->6->3->1->0, so that a(16) = 8.
%t A258242 r = Sqrt[3]; w = Table[Floor[r*n], {n, 1, 1000}];
%t A258242 f[x_] := If[MemberQ[w, x], Floor[x/r], Floor[r*x]];
%t A258242 g[x_] := Drop[FixedPointList[f, x], -1];
%t A258242 Table[-1+ Length[g[n]], {n, 0, 100}]
%Y A258242 Cf. A022838, A258241, A258212.
%K A258242 nonn,easy
%O A258242 0,3
%A A258242 _Clark Kimberling_, Jun 07 2015