The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 15:14 EDT 2023. Contains 363042 sequences. (Running on oeis4.)