A230630 - OEIS

A230630

a(1)=0; thereafter a(n) = (1 + a(floor(n/2))) mod 3.

0, 1, 1, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

For 2^i <= n < 2^(i+1), a(n) = (i mod 3).

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..32768

Index entries for sequences related to binary expansion of n

FORMULA

a(n) = A000523(n) (mod 3). - John M. Campbell, Jul 15 2016

MAPLE

f:=proc(n) option remember; if n=1 then 0 else (1+f(floor(n/2))) mod 3; fi; end; [seq(f(n), n=1..120)];