A324828 a(n) = A324543(n) read modulo 2, where A324543 is the Möbius-transform of sigma(A156552(n)).

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, 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, 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

Offset

1

Links

Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552)

Index entries for characteristic functions

Index entries for sequences computed from indices in prime factorization

Index entries for sequences related to sigma(n)

Formula

a(n) = A324543(n) mod 2 = A324712(n) mod 2 = A324715(n) mod 2.

a(p) = 1 for all primes p.

Prog

(PARI)
A324543(n) = sumdiv(n, d, moebius(n/d)*A323243(d)); \\ Needs also code from A323243.
A324828(n) = (A324543(n)%2);
(PARI)
A324712(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A323243(d)))); (v); };
A324828(n) = (A324712(n)%2);

Crossrefs

Cf. A323243, A324543, A324712, A324715, A324829.

Sequence in context: A189081 A296084 A302777 * A332823 A354817 A053867

Adjacent sequences: A324825 A324826 A324827 * A324829 A324830 A324831

Keyword

nonn

Author

Antti Karttunen, Mar 16 2019

Status

approved