|
Search: id:A133863
|
|
|
| A133863 |
|
Smallest odd prime base q such that p^13 divides q^(p-1) - 1, where p = Prime[n]. |
|
+0
7
|
|
| 40961, 19131877, 2441406251, 115385868869, 138090848575723, 358661570404751, 44510586506850631, 252317900773542353, 4465433274456775633, 39171440762351329829, 11887418854442931407, 14582408526413537791
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(1) = A035089(13) = 40961.
|
|
MATHEMATICA
|
Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^13 ] == 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, A133864, A133865.
Sequence in context: A046180 A164648 A097479 this_sequence A033532 A047828 A141711
Adjacent sequences: A133860 A133861 A133862 this_sequence A133864 A133865 A133866
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 26 2007
|
|
EXTENSIONS
|
Extended by Max Alekseyev (maxale(AT)gmail.com), May 08 2009
|
|
|
Search completed in 0.006 seconds
|
