|
Search: id:A125647
|
|
|
| A125647 |
|
Smallest odd prime base q such that p^6 divides q^(p-1) - 1, where p = Prime[n]. |
|
+0
12
|
|
| 193, 1459, 14557, 152617, 2120879, 7654109, 24527681, 2342959, 90603883, 1657641497, 40373093, 2175429661, 1614357949, 119612113, 14635471219, 2816276179, 15591204869, 1006953931, 7726467079, 48931161299, 54908441659, 41985419521, 583493688221, 200335697059, 96891225583, 50303508131, 129847013561, 362253784469, 625810253147, 195406393583
(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(193)); p=prime(n); x=znprimroot(p^6)^(p^5); vecsort( vector(p-1, i, y=lift(x^i); while(!isprime(y), y+=p^6); y ) )[1] } - Max Alekseyev (maxal(AT)cs.ucsd.edu), May 30 2007
|
|
CROSSREFS
|
Cf. A125609, A125610, A125611, A125612, A125632, A125633, A125634, A125635, A125636, A125637, A125645, A125646, A125648, A125649.
Sequence in context: A140631 A142117 A142564 this_sequence A120851 A115735 A023743
Adjacent sequences: A125644 A125645 A125646 this_sequence A125648 A125649 A125650
|
|
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
|
