%I #11 Mar 16 2019 21:46:01
%S 0,1,1,1,1,0,1,0,1,1,1,1,1,0,0,0,1,1,1,0,1,0,1,0,1,0,0,1,1,0,1,0,0,0,
%T 0,0,1,0,0,0,1,0,1,1,1,0,1,0,1,1,0,1,1,0,1,0,0,0,1,0,1,0,0,0,0,1,1,1,
%U 0,0,1,0,1,0,1,1,0,1,1,0,0,0,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,1,1,0,0,0
%N a(n) = A324543(n) read modulo 2, where A324543 is the Möbius-transform of sigma(A156552(n)).
%H Antti Karttunen, <a href="/A324828/b324828.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H <a href="/index/Ch#char_fns">Index entries for characteristic functions</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>
%F a(n) = A324543(n) mod 2 = A324712(n) mod 2 = A324715(n) mod 2.
%F a(p) = 1 for all primes p.
%o (PARI)
%o A324543(n) = sumdiv(n,d,moebius(n/d)*A323243(d)); \\ Needs also code from A323243.
%o A324828(n) = (A324543(n)%2);
%o (PARI)
%o A324712(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A323243(d)))); (v); };
%o A324828(n) = (A324712(n)%2);
%Y Cf. A323243, A324543, A324712, A324715, A324829.
%K nonn
%O 1
%A _Antti Karttunen_, Mar 16 2019