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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125649 Smallest odd prime base q such that p^8 divides q^(p-1) - 1, where p = prime(n). 11
257, 13121, 3124999, 3376853, 174625993, 533810141, 16048035481, 3620189879, 982740799, 547344139109, 497929938133, 1105109875657, 15682480615619, 1391016035411, 83209719751, 84224951222611, 165554755409789, 254747341131683, 701000310909907, 317304132615017 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
W. Keller and J. Richstein Fermat quotients that are divisible by p.
MATHEMATICA
Do[p = Prime[n]; q = 2; While[PowerMod[q, p-1, p^8] != 1, q = NextPrime[q]]; Print[q], {n, 100}] (* Ryan Propper, Apr 01 2007 *)
PROG
(PARI) { a(n) = local(p, x, y); if(n==1, return(257)); p=prime(n); x=znprimroot(p^8)^(p^7); vecsort( vector(p-1, i, y=lift(x^i); while(!isprime(y), y+=p^8); y ) )[1] } \\ Max Alekseyev, May 30 2007
CROSSREFS
Sequence in context: A279641 A168116 A086022 * A219549 A219548 A351865
KEYWORD
nonn
AUTHOR
Alexander Adamchuk, Nov 29 2006
EXTENSIONS
More terms from Ryan Propper, Apr 01 2007
More terms from Max Alekseyev, May 30 2007
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)