|
%I #8 Mar 15 2019 21:55:55
%S 0,2,4,0,8,14,16,4,4,24,32,26,64,50,8,0,128,28,256,48,20,96,512,48,8,
%T 192,4,102,1024,26,2048,24,100,384,24,28,4096,770,64,96,8192,118,
%U 16384,192,8,1536,32768,104,16,58,388,384,65536,52,40,196,256,3074,131072,114,262144,6144,68,8,200,166,524288,772,1540,120,1048576
%N Xor-Moebius transform of A324716, where A324716(n) = bitxor(2*A156552(n), bitand(2*A156552(n), A323243(n))).
%C Properties of Xor-Moebius transform are explained in A295901.
%H Antti Karttunen, <a href="/A324717/b324717.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o (PARI) A324717(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A324716(d)))); (v); }; \\ For other code, see A324716.
%Y Cf. A156552, A295901, A324712, A324713, A324716.
%K nonn
%O 1,2
%A _Antti Karttunen_, Mar 15 2019
|
