login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A258238
Number of steps from n to 0, where allowable steps are x -> [x/r] if x = is in A001951 (the Beatty sequence for sqrt(2)) and x -> [r*x] otherwise, where [ ] = floor and r = sqrt(2).
3
0, 1, 2, 4, 3, 5, 7, 4, 6, 8, 10, 5, 7, 9, 9, 11, 6, 8, 8, 10, 12, 10, 12, 14, 7, 9, 9, 11, 11, 13, 15, 11, 13, 15, 17, 8, 10, 12, 10, 12, 14, 12, 14, 16, 18, 12, 14, 16, 16, 18, 9, 11, 11, 13, 15, 11, 13, 15, 17, 13, 15, 17, 17, 19, 21, 13, 15, 17, 19, 17
OFFSET
0,3
COMMENTS
a(n) = number of edges from 0 to n in the tree at A258237.
LINKS
EXAMPLE
36->25->17->24->16->11->7->4->2->1->0, so that a(36) = 10.
MATHEMATICA
r = Sqrt[2]; w = Table[Floor[r*n], {n, 1, 1000}];
f[x_] := If[MemberQ[w, x], Floor[x/r], Floor[r*x]];
g[x_] := Drop[FixedPointList[f, x], -1];
Table[-1+ Length[g[n]], {n, 0, 100}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jun 05 2015
STATUS
approved