login
A393054
Number of divisors d of n such that d and A276086(n) are not coprime, where A276086 is the primorial base exp-function.
3
0, 0, 1, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 3, 0, 0, 0, 0, 3, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 4, 0, 4, 0, 0, 5, 0, 0, 0, 2, 4, 2, 0, 0, 0, 2, 4, 2, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 2, 6, 0, 0, 0, 0, 5, 0, 2, 0, 0, 5, 4, 0, 0, 6, 2, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 4, 4, 6, 0, 0, 0, 0, 7
OFFSET
1,9
FORMULA
a(n) = Sum_{d|n} [gcd(d,A276086(n)) > 1], where [ ] is the Iverson bracket.
a(n) = A000005(n) - A393053(n).
PROG
(PARI)
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A393054(n) = { my(x=A276086(n)); sumdiv(n, d, 1!=gcd(d, x)); };
CROSSREFS
Cf. also A393052.
Sequence in context: A328828 A276009 A328842 * A113302 A292946 A196078
KEYWORD
nonn,base,easy
AUTHOR
Antti Karttunen, Feb 04 2026
STATUS
approved