A324832 Number of divisors d of n such that A323243(d) == 2 (mod 3).

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

Links

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

Index entries for sequences related to binary expansion of n

Index entries for sequences computed from indices in prime factorization

Index entries for sequences related to sigma(n)

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 A357905 A173920

Adjacent sequences: A324829 A324830 A324831 * A324833 A324834 A324835

Keyword

nonn

Author

Antti Karttunen, Mar 16 2019

Status

approved