login
A355655
a(n) = 1 if the smallest b > 1 such that b^(p-1) == 1 (mod p^2) is prime, 0 otherwise, with p = prime(n).
2
1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0
OFFSET
1
FORMULA
a(n) = A010051(A039678(n)).
PROG
(PARI) a(n) = my(p=prime(n)); for(b=2, oo, if(Mod(b, p^2)^(p-1)==1, return(ispseudoprime(b))))
CROSSREFS
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Jul 12 2022
STATUS
approved