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).

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

Links

Table of n, a(n) for n=1..87.

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

Cf. A010051, A039678, A355656, A355657.

Sequence in context: A317906 A102863 A131483 * A077052 A133566 A185907

Adjacent sequences: A355652 A355653 A355654 * A355656 A355657 A355658

Keyword

nonn

Author

Felix Fröhlich, Jul 12 2022

Status

approved