|
Search: id:A133865
|
|
|
| A133865 |
|
Smallest odd prime base q such that p^15 divides q^(p-1) - 1, where p = Prime[n]. |
|
+0
7
|
|
| 65537, 57395627, 122070312499, 56020344873707, 6266190914259137, 65106791321062951, 12132548193910221893, 50407811312994280933
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(1) = A035089(15) = 65537.
|
|
MATHEMATICA
|
Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^15 ] == 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, A133859, A133860, A133861, A133862, A133863, A133864.
Sequence in context: A017695 A013964 A036094 this_sequence A096555 A063825 A043678
Adjacent sequences: A133862 A133863 A133864 this_sequence A133866 A133867 A133868
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 26 2007
|
|
|
Search completed in 0.002 seconds
|
