This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A273433 #12 May 27 2016 03:09:50 %S A273433 3,8,57,1047,27216,861642,21444846,674273372,147534349327, %T A273433 45941644105613,244158265828023,569209871196597077, %U A273433 15204969799577672558,2111244131216208612515,129192323492968413250921,25814874251189658671192458,13543096262710710570994132579 %N A273433 Smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^n). %H A273433 Hiroaki Yamanouchi, <a href="/A273433/b273433.txt">Table of n, a(n) for n = 1..46</a> %F A273433 a(n) = A257833(n, n) for n > 1. %o A273433 (PARI) a(n) = my(p=prime(n), b=2); while(Mod(b, p^n)^(p-1)!=1, b++); b %Y A273433 Cf. A257833. %K A273433 nonn %O A273433 1,1 %A A273433 _Felix Fröhlich_, May 22 2016 %E A273433 a(9)-a(17) from _Hiroaki Yamanouchi_, May 26 2016