A215604 - OEIS

%I #6 Aug 22 2012 00:17:15

%S 0,1,0,1,1,2,1,2,0,1,0,1,1,2,1,2,1,2,1,2,2,0,2,0,1,2,1,2,2,0,2,0,0,1,

%T 0,1,1,2,1,2,0,1,0,1,1,2,1,2,1,2,1,2,2,0,2,0,1,2,1,2,2,0,2,0,1,2,1,2,

%U 2,0,2,0,1,2,1,2,2,0,2,0,2,0,2,0,0,1,0,1,2

%N a(0)=0, a(n) = (n + a(floor(n/2))) mod 3.

%o (Python)

%o TOP = 1000

%o a = [0]*TOP

%o for n in range(1, TOP):

%o     print a[n-1],

%o     a[n] = (n + a[n//2]) % 3

%Y Cf. A010060 ((n + a(floor(n/2))) mod 2).

%Y Cf. A051065 ((n + a(floor(n/3))) mod 2).

%Y Cf. A053838 ((n + a(floor(n/3))) mod 3).

%K nonn,easy

%O 0,6

%A _Alex Ratushnyak_, Aug 17 2012