A324872 a(n) = A001222(n) + A061395(n) - A324861(n).

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

Offset: 1

Author

Antti Karttunen, Mar 21 2019

Keywords

• nonn

Comments

Records 0, 1, 2, 6, 7, 10, 14, etc., occur at n = 1, 2, 50, 125, 243, 1729, 8192, etc.

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. A001222, A061395, A252464, A324861, A324870, A324876.

Programs

PARI

A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
A324861(n) = #binary(A324876(n)); \\ Needs also code from A324876.
A324872(n) = (bigomega(n)+A061395(n)-A324861(n));

Formula

a(n) = A001222(n) + A061395(n) - A324861(n).

a(n) = 1 + A252464(n) - A324861(n).

a(p) = 1 for all primes p.