|
%I #8 Jun 06 2021 15:51:39
%S 40961,19131877,2441406251,115385868869,138090848575723,
%T 358661570404751,44510586506850631,252317900773542353,
%U 4465433274456775633,39171440762351329829,11887418854442931407,14582408526413537791
%N Smallest odd prime base q such that p^13 divides q^(p-1) - 1, where p = prime(n).
%e a(1) = A035089(13) = 40961.
%t Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^13 ] == 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, A133860, A133861, A133862, A133864, A133865.
%K nonn
%O 1,1
%A _Alexander Adamchuk_, Sep 26 2007
%E Extended by _Max Alekseyev_, May 08 2009
|
