%I #14 Nov 27 2017 12:43:21

%S 0,0,0,0,14,6,3,0,29,0,31,10,25,1,2,0,50,5,55,12,7,13,50,18,48,27,26,

%T 13,40,112,25,0,112,116,115,29,97,117,114,20,101,49,126,1,24,16,105,

%U 34,102,60,42,7,80,16,33,21,62,42,77,220,75,23,16,0,212,18,199,248,231,25,194,77,197,227,238,25,246,48,201,36

%N a(n) = A000203(n) XOR A005187(n), where XOR is bitwise-XOR, A003987.

%H Antti Karttunen, <a href="/A294899/b294899.txt">Table of n, a(n) for n = 1..16384</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>

%F a(n) = A000203(n) XOR A005187(n).

%t Array[BitXor[DivisorSigma[1, #], IntegerExponent[(2 #)!, 2]] &, 80] (* _Michael De Vlieger_, Nov 26 2017 *)

%o (Scheme) (define (A294899 n) (A003987bi (A000203 n) (A005187 n))) ;; Where A003987bi implements the bitwise-XOR, A003987.

%Y Cf. A000203, A003987, A005187, A294898, A295296 (positions of zeros), A295297 (parity of a(n)).

%Y Cf. also A169813, A279357, A283997.

%K nonn

%O 1,5

%A _Antti Karttunen_, Nov 25 2017