The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324810 Sum of A324828(d) over the divisors d of n. 2
 0, 1, 1, 2, 1, 2, 1, 2, 2, 3, 1, 4, 1, 2, 2, 2, 1, 4, 1, 4, 3, 2, 1, 4, 2, 2, 2, 4, 1, 4, 1, 2, 2, 2, 2, 6, 1, 2, 2, 4, 1, 4, 1, 4, 4, 2, 1, 4, 2, 5, 2, 4, 1, 4, 3, 4, 2, 2, 1, 6, 1, 2, 4, 2, 2, 4, 1, 4, 2, 4, 1, 6, 1, 2, 4, 4, 2, 4, 1, 4, 2, 2, 1, 8, 2, 2, 2, 4, 1, 8, 3, 4, 2, 2, 2, 4, 1, 3, 4, 6, 1, 4, 1, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Inverse Möbius transform of A324828. LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552) FORMULA a(n) = Sum_{d|n} A324828(d). a(p) = 1 for all primes p. A000035(a(n)) = A324823(n) = A323243(n) mod 2. PROG (PARI) A324712(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A323243(d)))); (v); }; \\ Needs also code from A323243. A324828(n) = (A324712(n)%2); A324810(n) = sumdiv(n, d, A324828(d)); CROSSREFS Cf. A000203, A156552, A323243, A324543, A324712, A324823, A324825, A324828. Sequence in context: A057828 A082498 A112223 * A353351 A178771 A289498 Adjacent sequences: A324807 A324808 A324809 * A324811 A324812 A324813 KEYWORD nonn AUTHOR Antti Karttunen, Mar 17 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 31 08:37 EDT 2023. Contains 361645 sequences. (Running on oeis4.)