|
%I #9 Jun 30 2022 08:39:53
%S 0,0,0,2,0,0,1,0,0,0,0,2,2,2,0,2,0,0,0,2,0,0,1,0,1,1,1,0,0,0,1,0,0,0,
%T 0,2,0,0,1,0,0,0,0,2,2,2,0,2,2,2,2,1,2,2,0,2,0,0,0,2,2,2,0,2,0,0,0,2,
%U 0,0,1,0,0,0,0,2,2,2,0,2,0,0,0,2,0,0,1,0,1,1,1,0,0,0,1,0,1,1,1,0,1,1,2,1,1,1,1,0,0,0,1,0,0,0,0,2,0,0,1,0,1
%N a(n) = A048724(n) mod 3.
%H Antti Karttunen, <a href="/A284574/b284574.txt">Table of n, a(n) for n = 0..8192</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F a(n) = A048724(n) mod 3.
%o (Scheme) (define (A284574 n) (modulo (A048724 n) 3))
%o (Python)
%o def A284574(n): return (n^ n<<1)%3 # _Chai Wah Wu_, Jun 29 2022
%Y Cf. A048724, A284557, A284575.
%K nonn,base
%O 0,4
%A _Antti Karttunen_, Apr 10 2017
|
