|
| |
|
|
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; 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 (rpropper(AT)stanford.edu), 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 (maxale(AT)gmail.com), May 30 2007
|
|
|
CROSSREFS
| Cf. A125609, A125610, A125611, A125612, A125632, A125633, A125634, A125635, A125636, A125637, A125645, A125646, A125647, A125648.
Sequence in context: A023877 A168116 A086022 * A097736 A103349 A194155
Adjacent sequences: A125646 A125647 A125648 * A125650 A125651 A125652
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 29 2006
|
|
|
EXTENSIONS
| More terms from Ryan Propper (rpropper(AT)stanford.edu), Apr 01 2007
More terms from Max Alekseyev (maxale(AT)gmail.com), May 30 2007
|
| |
|
|
