The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 Jun 06 2021 15:52:07
%S 65537,57395627,122070312499,56020344873707,6266190914259137,
%T 65106791321062951,12132548193910221893,50407811312994280933,
%U 172048888780798211059,16668261908754510204233,35965174106571679882189
%N Smallest odd prime base q such that p^15 divides q^(p-1) - 1, where p = prime(n).
%e a(1) = A035089(15) = 65537.
%t Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^15 ] == 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, A133863, A133864.
%K nonn
%O 1,1
%A _Alexander Adamchuk_, Sep 26 2007
%E Extended by _Max Alekseyev_, May 08 2009