A324868 Binary weight of A324398(n).

0, 0, 0, 1, 0, 1, 0, 1, 2, 0, 0, 1, 0, 1, 1, 2, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 1, 2, 2, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 0, 1, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 2, 3, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 2, 1, 2, 1, 0, 2, 2, 1, 0, 1, 1, 3, 0, 0, 2, 2, 0, 1, 0, 1, 2

Offset: 1

Author

Antti Karttunen, Mar 18 2019

Keywords

• nonn

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)

Crossrefs

Cf. A000120, A156552, A323243, A324398, A324816.

Programs

PARI

A156552(n) = {my(f = factor(n), p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552
A324398(n) = { my(k=A156552(n)); bitand(k,(A323243(n)-k)); }; \\ Needs also code from A323243.
A324868(n) = hammingweight(A324398(n));

Formula

a(n) = A000120(A324398(n)).