|
%I #30 May 06 2021 11:04:24
%S 0,1,3,2,7,6,2,3,15,14,2,3,6,7,5,4,31,30,2,3,6,7,5,4,14,15,13,12,5,4,
%T 4,5,63,62,2,3,6,7,5,4,14,15,13,12,5,4,4,5,30,31,29,28,5,4,4,5,13,12,
%U 12,13,4,5,7,6,127,126,2,3,6,7,5,4,14,15,13,12,5,4,4,5,30,31,29,28,5,4,4,5,13,12,12,13,4,5,7,6,62,63,61,60,5,4,4,5,13,12,12
%N a(n) = n XOR A005187(floor(n/2)), where XOR is bitwise-xor (A003987).
%H Antti Karttunen, <a href="/A283997/b283997.txt">Table of n, a(n) for n = 0..8191</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F a(n) = n XOR A005187(floor(n/2)), where XOR is bitwise-xor (A003987).
%F a(n) = A283996(n) - A283998(n).
%F a(n) = A005187(n) - 2*A283998(n).
%F a(n) = A006068(n) XOR A283999(floor(n/2)).
%t Table[BitXor[n, 2 # - DigitCount[2 #, 2, 1] &@ Floor[n/2]], {n, 0, 106}] (* _Michael De Vlieger_, Mar 20 2017 *)
%o (Scheme) (define (A283997 n) (A003987bi n (A005187 (floor->exact (/ n 2))))) ;; Where A003987bi implements bitwise-XOR (A003987).
%o (PARI) b(n) = if(n<1, 0, b(n\2) + n%2);
%o A(n) = 2*n - b(2*n);
%o for(n=0, 110, print1(bitxor(n, A(floor(n/2))),", ")) \\ _Indranil Ghosh_, Mar 25 2017
%o (Python)
%o def A(n): return 2*n - bin(2*n)[2:].count("1")
%o print([n^A(n//2) for n in range(111)]) # _Indranil Ghosh_, Mar 25 2017
%Y Cf. A003986, A005187, A006068, A283996, A283998, A283999.
%Y Cf. also A279357, A283477.
%K nonn,base,hear
%O 0,3
%A _Antti Karttunen_, Mar 19 2017
|
