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 A248972 #34 Apr 29 2019 11:01:04
%S A248972 2,2,2,3,3,5,3,5,7,3,3,3,5,3,5,7,3,5,3,3,3,5,13,3,3,3,5,3,5,7,5,13,3,
%T A248972 3,13,3,11,5,3,3,3,11,3,11,3,3,5,3,7,3,3,5,3,5,11,3,3,5,11,3,7,5,5,3,
%U A248972 5,3,5,3,3,3,5,3,3,3,19,3,3,3,7,7,3,3,11,5,3,3,5,3,11,5,3,7
%N A248972 a(n) is the smallest b such that b^((p-1)/2) == -1 (mod p) where p = A080076(n) is the n-th Proth prime.
%C A248972 Proth's theorem asserts that p=1+k*2^m (with odd k < 2^m) is prime if there exists b such that b^((p-1)/2) == -1 (mod n). This sequence lists the smallest b which certifies primality of A080076(n) via this relation.
%C A248972 For n > 3, a(n) is an odd prime. - _Thomas Ordowski_, Apr 23 2019
%F A248972 a(n) = A020649(A080076(n)) = A053760(k), where prime(k) = A080076(n). - _Thomas Ordowski_, Apr 23 2019
%o A248972 (PARI) A248972(n)=my(N=A080076[n]);for(a=0,9e9,Mod(a,N)^(N\2)==-1&&return(a))
%o A248972 A080076=[];forprime(p=1,99999,isproth(p)&&(A080076=concat(A080076,p))&&print1(A248972(#A080076)","))
%o A248972 isproth(x)={ !bittest(x--, 0) & (x>>valuation(x, 2))^2 < x }
%Y A248972 Cf. A080076.
%Y A248972 A subsequence of A020649 and of A053760.
%K A248972 nonn
%O A248972 1,1
%A A248972 _M. F. Hasler_, Oct 18 2014