|
%I #14 Jun 29 2022 09:10:50
%S 0,1,2,0,1,0,0,0,2,0,0,1,0,2,0,0,1,2,0,1,0,2,2,2,0,1,1,2,0,2,0,0,2,0,
%T 1,2,0,2,2,2,0,1,1,2,1,0,1,1,0,1,2,0,2,1,1,1,0,1,1,2,0,2,0,0,1,2,0,1,
%U 2,1,1,1,0,1,1,2,1,0,1,1,0,1,2,0,2,1,1,1,2,0,0,1,2,1,2,2,0,1,2,0,1,0,0,0,1,2,2,0,2,1,2,2,0,1,2,0,2,1,1,1,0
%N a(n) = A048727(n) mod 3.
%H Antti Karttunen, <a href="/A284557/b284557.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) = A048727(n) mod 3.
%o (Scheme)
%o (define (A284557 n) (modulo (A048727 n) 3))
%o (define (A284557 n) (A284270bi 3 n)) ;; For A284270bi see A284270.
%o (Python)
%o def A284557(n): return (n^ n<<1 ^ n<<2) % 3 # _Chai Wah Wu_, Jun 29 2022
%Y Row 3 of array A284270 (after the initial zero).
%Y Cf. A048727, A284555 (positions of zeros), A284574, A284575.
%K nonn,base
%O 0,3
%A _Antti Karttunen_, Apr 10 2017
|
