[go: up one dir, main page]

login
A374474
a(n) = 1 if the least prime dividing the sum of divisors of n is equal to the least prime not dividing n, otherwise a(n) = 0.
3
0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0
OFFSET
1
FORMULA
a(n) = [A020639(A000203(n)) = A053669(n)], where [ ] is the Iverson bracket.
PROG
(PARI)
A020639(n) = if(1==n, n, vecmin(factor(n)[, 1]));
A053669(n) = forprime(p=2, , if(n%p, return(p)));
A374474(n) = (A020639(sigma(n))==A053669(n));
CROSSREFS
Characteristic function of A374475.
Cf. also A370124.
Sequence in context: A370702 A189687 A353817 * A284653 A359158 A099104
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 06 2024
STATUS
approved