The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324831 Number of divisors d of n such that A323243(d) == 1 (mod 3). 6
 0, 1, 0, 2, 1, 1, 0, 2, 0, 3, 1, 2, 0, 1, 1, 2, 1, 1, 0, 4, 0, 2, 1, 2, 2, 1, 0, 2, 0, 3, 1, 2, 1, 2, 1, 3, 0, 1, 0, 4, 1, 1, 0, 3, 1, 2, 1, 2, 0, 5, 1, 2, 0, 1, 3, 2, 0, 1, 1, 4, 0, 2, 0, 2, 1, 2, 1, 4, 1, 3, 0, 3, 1, 1, 2, 2, 1, 2, 0, 4, 0, 2, 1, 3, 2, 1, 0, 3, 0, 3, 0, 4, 1, 2, 1, 2, 1, 1, 1, 6, 0, 2, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 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) + A324832(n)). For all n >= 1, a(A000040(n)) = A000035(n). PROG (PARI) A324831(n) = sumdiv(n, d, (1==(A323243(d))%3)); CROSSREFS Cf. A000005, A000203, A156552, A323243, A324830, A324832. Sequence in context: A166712 A035183 A178101 * A054522 A110250 A065252 Adjacent sequences:  A324828 A324829 A324830 * A324832 A324833 A324834 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 May 8 09:57 EDT 2021. Contains 343666 sequences. (Running on oeis4.)