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 A087576 #22 Nov 16 2019 16:37:12
%S A087576 3,3,3,3,9,39,9,3,11,3,15,9,9,3,3,15,5,9,63,15,27,39,41,3,51,3,59,75,
%T A087576 119,99,71,141,209,87,65,3,275,45,23,21,27,27,69,477,59,147,231,1605,
%U A087576 9,291,65,15,75,57,9,225,119,273,855,33,77,513,3,219,75,51,489,369
%N A087576 Smallest number k > 1 such that k^n+2 is prime.
%C A087576 Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - _Hugo Pfoertner_, Nov 16 2019
%H A087576 Hugo Pfoertner, <a href="/A087576/b087576.txt">Table of n, a(n) for n = 1..1000</a>
%t A087576 Table[k = 2; While[p = k^n + 2; ! PrimeQ[p], k++]; k, {n, 68}] (* _T. D. Noe_, Apr 03 2012 *)
%o A087576 (PARI) for(n=1,68,forstep(k=3,oo,2,if(isprime(k^n+2),print1(k,", ");break))) \\ _Hugo Pfoertner_, Oct 30 2018
%Y A087576 Cf. A095302 (corresponding primes), A095303 (smallest k such that k^n-2 is prime), A095304 (corresponding primes).
%K A087576 nonn
%O A087576 1,1
%A A087576 _Amarnath Murthy_, Sep 17 2003
%E A087576 Corrected and extended by _Hugo Pfoertner_, computed using PFGW, Jun 01 2004
%E A087576 a(49) corrected by _T. D. Noe_, Apr 03 2012