Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 May 27 2016 03:09:50
%S 3,8,57,1047,27216,861642,21444846,674273372,147534349327,
%T 45941644105613,244158265828023,569209871196597077,
%U 15204969799577672558,2111244131216208612515,129192323492968413250921,25814874251189658671192458,13543096262710710570994132579
%N Smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^n).
%H Hiroaki Yamanouchi, <a href="/A273433/b273433.txt">Table of n, a(n) for n = 1..46</a>
%F a(n) = A257833(n, n) for n > 1.
%o (PARI) a(n) = my(p=prime(n), b=2); while(Mod(b, p^n)^(p-1)!=1, b++); b
%Y Cf. A257833.
%K nonn
%O 1,1
%A _Felix Fröhlich_, May 22 2016
%E a(9)-a(17) from _Hiroaki Yamanouchi_, May 26 2016