The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275338 Smallest prime p where a base b with 1 < b < p exists such that b^(p-1) == 1 (mod p^n). 0
 3, 11, 113 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Smallest prime p such that A254444(i) >= n, where i is the index of p in A000040. For n > 1, a(n) is a term of A134307. For n > 1, if A000040(i) is a term of the sequence, then A249275(i) < A000040(i). For n > 1, smallest prime p such that T(n, i) < p, where i is the index of p in A000040 and T = A257833. a(4) > 5*10^8 if it exists (see Fischer link). LINKS R. Fischer, Thema: Fermatquotient B^(P-1) == 1 (mod P^3). EXAMPLE For n = 3: p = 113 satisfies 68^(p-1) == 1 (mod p^3) and there is no smaller prime p such that p satisfies b^(p-1) == 1 (mod p^3) for some b with 1 < b < p, so a(3) = 113. PROG (PARI) a(n) = forprime(p=1, , for(b=2, p-1, if(Mod(b, p^n)^(p-1)==1, return(p)))) CROSSREFS Cf. A134307, A254444, A257833. Sequence in context: A183381 A136985 A131546 * A068693 A036930 A198085 Adjacent sequences:  A275335 A275336 A275337 * A275339 A275340 A275341 KEYWORD nonn,hard,more,bref AUTHOR Felix Fröhlich, Jul 28 2016 STATUS approved

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

Last modified October 26 02:14 EDT 2021. Contains 348256 sequences. (Running on oeis4.)