|
%I #8 Jun 06 2021 19:04:08
%S 12289,472391,78124999,135967277,24262286441,38050596989,
%T 5498076927457,8388044818849,30794280412669,45941644105613,
%U 1205285836084793,7909086479714171,1438991183761177,47101607991825047,18067554193458689
%N Smallest odd prime base q such that p^10 divides q^(p-1) - 1, where p = prime(n).
%e a(1) = A035089(10) = 12289.
%t Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^10 ] == 1, k++ ]; Print[ { n, Prime[ k ] } ], {n, 1, 100} ]
%Y Cf. A035089, A125609, A125610, A125611, A125612, A125632, A125633, A125634, A125635, A125636, A125637, A125645, A125646, A125647, A125648, A125649, A133859, A133861, A133862, A133863, A133864, A133865.
%K nonn
%O 1,1
%A _Alexander Adamchuk_, Sep 26 2007
%E Extended by _Max Alekseyev_, May 08 2009
|
