|
Search: id:A125645
|
|
|
| A125645 |
|
Smallest odd prime base q such that p^4 divides q^(p-1) - 1, where p = Prime[n]. |
|
+0
12
|
|
| 17, 163, 443, 3449, 45989, 239, 15541, 2819, 60793, 78017, 690143, 398023, 1977343, 574081, 1513367, 4388179, 3198427, 8065789, 3246107, 1353383, 5934307, 15631613, 2864371, 14754769, 15012733, 1358891, 32414783, 119551, 21860063, 11281097
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
W. Keller and J. Richstein Fermat quotients that are divisible by p.
|
|
PROGRAM
|
(PARI) { a(n) = local(p, x, y); if(n==1, return(97)); p=prime(n); x=znprimroot(p^4)^(p^3); vecsort( vector(p-1, i, y=lift(x^i); while(!isprime(y), y+=p^4); y ) )[1] } - Max Alekseyev (maxal(AT)cs.ucsd.edu), May 30 2007
|
|
CROSSREFS
|
Cf. A125609, A125610, A125611, A125612, A125632, A125633, A125634, A125635, A125636, A125637, A125646, A125647, A125648, A125649.
Sequence in context: A142087 A125380 A126538 this_sequence A068518 A096192 A076458
Adjacent sequences: A125642 A125643 A125644 this_sequence A125646 A125647 A125648
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 29 2006
|
|
EXTENSIONS
|
More terms from Max Alekseyev (maxal(AT)cs.ucsd.edu), May 30 2007
|
|
|
Search completed in 0.002 seconds
|
