This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275338 #35 Jul 28 2016 22:35:53 %S A275338 3,11,113 %N A275338 Smallest prime p where a base b with 1 < b < p exists such that b^(p-1) == 1 (mod p^n). %C A275338 Smallest prime p such that A254444(i) >= n, where i is the index of p in A000040. %C A275338 For n > 1, a(n) is a term of A134307. %C A275338 For n > 1, if A000040(i) is a term of the sequence, then A249275(i) < A000040(i). %C A275338 For n > 1, smallest prime p such that T(n, i) < p, where i is the index of p in A000040 and T = A257833. %C A275338 a(4) > 5*10^8 if it exists (see Fischer link). %H A275338 R. Fischer, <a href="http://www.fermatquotient.com/FermatQuotienten/FermatQ3.txt">Thema: Fermatquotient B^(P-1) == 1 (mod P^3)</a>. %e A275338 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. %o A275338 (PARI) a(n) = forprime(p=1, , for(b=2, p-1, if(Mod(b, p^n)^(p-1)==1, return(p)))) %Y A275338 Cf. A134307, A254444, A257833. %K A275338 nonn,hard,more,bref %O A275338 1,1 %A A275338 _Felix Fröhlich_, Jul 28 2016