|
Search: id:A133859
|
|
|
| A133859 |
|
Smallest odd prime base q such that p^9 divides q^(p-1) - 1, where p = Prime[n]. |
|
+0
7
|
|
| 7681, 39367, 7812499, 135967277, 4715895383, 822557039, 48718117843, 513127081109
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(1) = A035089(9) = 7681.
a(2) = A125609(9) = 39367.
a(3) = A125610(9) = 7812499.
|
|
MATHEMATICA
|
Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^9 ] == 1, k++ ]; Print[ { n, Prime[ k ] } ], {n, 1, 100} ]
|
|
CROSSREFS
|
Cf. A035089, A125609, A125610, A125611, A125612, A125632, A125633, A125634, A125635, A125636, A125637, A125645, A125646, A125647, A125648, A125649, A133860, A133861, A133862, A133863, A133864, A133865.
Adjacent sequences: A133856 A133857 A133858 this_sequence A133860 A133861 A133862
Sequence in context: A008774 A076339 A105132 this_sequence A012082 A035907 A092004
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 26 2007
|
|
|
Search completed in 0.002 seconds
|
