|
%I
%S 12289,1062881,292968749,7909306973,1194631280321,2395794301259,
%T 38413406256881,77460384757423,30794280412669,4161130688896397,
%U 3748333074529501,240404931594746129,191828075390557213
%N Smallest odd prime base q such that p^11 divides q^(p-1) - 1, where p = Prime[n].
%e a(1) = A035089(11) = 12289.
%t Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^11 ] == 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, A133862, A133863, A133864, A133865.
%K nonn
%O 1,1
%A _Alexander Adamchuk_, Sep 26 2007
%E Extended by _Max Alekseyev_, May 08 2009
|
