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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324832 Number of divisors d of n such that A323243(d) == 2 (mod 3). 6
 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 0, 0, 3, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 3, 0, 0, 0, 3, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 1, 0, 1, 0, 0, 0, 2, 0, 2, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,32 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552) FORMULA a(n) = A000005(n) - (A324830(n) + A324831(n)). a(p) = 0 for all primes p. PROG (PARI) A324832(n) = sumdiv(n, d, (2==(A323243(d))%3)); CROSSREFS Cf. A000005, A000203, A156552, A323243, A324830, A324831. Sequence in context: A064727 A343222 A112378 * A035203 A173920 A230001 Adjacent sequences:  A324829 A324830 A324831 * A324833 A324834 A324835 KEYWORD nonn AUTHOR Antti Karttunen, Mar 16 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 16:03 EST 2022. Contains 350599 sequences. (Running on oeis4.)