login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253718 Number h such that (h,0) is n steps from (0,0), where steps are as follows: (x,y)->(x-r, y) if r > 0, and (x,y)->(y, r/3) otherwise, where r = x mod 3. 2
0, 1, 1, 3, 4, 4, 3, 4, 4, 5, 6, 6, 6, 7, 7, 6, 7, 7, 5, 6, 6, 6, 7, 7, 6, 7, 7, 7, 8, 8, 8, 9, 9, 8, 9, 9, 8, 9, 9, 9, 10, 10, 9, 10, 10, 8, 9, 9, 9, 10, 10, 9, 10, 10, 7, 8, 8, 8, 9, 9, 8, 9, 9, 8, 9, 9, 9, 10, 10, 9, 10, 10, 8, 9, 9, 9, 10, 10, 9, 10, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

This is column 1 of the array at A253281.

LINKS

Clark Kimberling, Table of n, a(n) for n = 0..1000

MATHEMATICA

f[{x_, y_}] := If[IntegerQ[x/3], {y, x/3}, {x - Mod[x, 3], y}];

g[{x_, y_}] := Drop[FixedPointList[f, {x, y}], -1];

Table[-1 + Length[g[{n, 0}]], {n, 0, 200}]  (* A253718 *)

CROSSREFS

Cf. A253281.

Sequence in context: A085005 A306477 A276865 * A295570 A035004 A222290

Adjacent sequences:  A253715 A253716 A253717 * A253719 A253720 A253721

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, May 02 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 20:26 EDT 2021. Contains 343137 sequences. (Running on oeis4.)