login
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
OFFSET
1,32
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
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 16 2019
STATUS
approved