|
| |
|
|
A125648
|
|
Smallest odd prime base q such that p^7 divides q^(p-1) - 1, where p = Prime[n].
|
|
11
| |
|
|
257, 4373, 735443, 3294173, 28723679, 533810141, 38277341, 47579927, 982740799, 33956348611, 77141582851, 174329354539, 82984891817, 109051450427, 83209719751, 1352085061013, 171168499897, 1822904926391, 2870322429133, 3589197993463, 2603594622571, 5834621843669, 1411025860033, 20635686238253, 1580041060459, 26763849212297, 8216934406781, 28482190726739, 97876187600351
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| W. Keller and J. Richstein Fermat quotients that are divisible by p.
|
|
|
PROG
| (PARI) { a(n) = local(p, x, y); if(n==1, return(257)); p=prime(n); x=znprimroot(p^7)^(p^6); vecsort( vector(p-1, i, y=lift(x^i); while(!isprime(y), y+=p^7); 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, A125649.
Sequence in context: A054801 A173892 A031604 * A155468 A034682 A017679
Adjacent sequences: A125645 A125646 A125647 * A125649 A125650 A125651
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 29 2006
|
|
|
EXTENSIONS
| More terms from Max Alekseyev (maxale(AT)gmail.com), May 30 2007
|
| |
|
|
