login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214972 a(n) = a(floor(2*(n-1)/3)) + 1, where a(0) = 0. 1
0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
Conjecture: a(n) = a(n-1) + 1 if n is in A152009, and a(n) = a(n-1) otherwise.
EXAMPLE
a(10) = a(9*2/3)+1 = a(6)+1 = 3+1 = 4.
MATHEMATICA
a[0] := 0; a[n_] := a[Floor[2*(n-1)/3]] + 1; Table[a[n], {n, 0, 120}]
PROG
(PARI) a214972(n) = {local(nn, r); nn=n; r=0; while(nn>0, r=r+1; nn=floor(2*(nn-1)/3)); r} \\ Michael B. Porter, Oct 30 2012
(Maxima)
a[0]:0$
a[n]:=a[floor(2*(n-1)/3)] + 1$
A214972(n):=a[n];
makelist(A214972(n), n, 0, 30); /* Martin Ettl, Oct 31 2012 */
CROSSREFS
Sequence in context: A368942 A088141 A185283 * A225687 A083291 A169894
KEYWORD
nonn
AUTHOR
Clark Kimberling, Oct 19 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 10 01:29 EDT 2024. Contains 371563 sequences. (Running on oeis4.)