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 A053703 #22 Jun 29 2025 21:40:28
%S A053703 11,29,83,127,6563,24391,59051,161053,357913,571789,1442899,4782971,
%T A053703 5177719,14348909,18191449,30080233,73560061,80062993,118370773,
%U A053703 127263529,131872231,318611989,344472103
%N A053703 Primes q of form q=p^w+2 where p is odd prime, w>=2.
%C A053703 For even w, p=3 is the only prime for which p^w+2 can be prime because all primes greater than 3 have the form 6k+-1. For odd w, only primes p=3 and p=6k-1 need to be considered because all primes of the form p=6k+1 will produce a number p^w+2 that is divisible by 3. - _T. D. Noe_, Feb 25 2011
%H A053703 T. D. Noe, <a href="/A053703/b053703.txt">Table of n, a(n) for n = 1..1005</a>
%F A053703 Primes of A025475(n)+2 form, excluding 1+2.
%F A053703 a(n) = A053702(n)+2. [_R. J. Mathar_, Apr 18 2010]
%e A053703 11=3^2+2, 127=5^3+2, 83=3^4+2, 161051=11^5+2,.. 318611989=683^2+2, 344472103=701^3+2
%t A053703 lst={}; Do[p=Prime[n]; fi=FactorInteger[p-2]; If[Length[fi]==1 && Last[Last[fi]]>1, AppendTo[lst,p]], {n,20000000}]; lst (* _Vladimir Joseph Stephan Orlovsky_, Feb 25 2011 *)
%t A053703 nn=10^9; t=Table[Select[Table[2 + Prime[i]^k, {i, PrimePi[nn^(1/k)]}], PrimeQ], {k, 2, Log[3, nn]}]; Union[Flatten[t]] (* _T. D. Noe_, Feb 25 2011 *)
%Y A053703 Cf. A025475.
%K A053703 nonn
%O A053703 1,1
%A A053703 _Labos Elemer_, Feb 14 2000
%E A053703 Constraint on w added to definition. a(11) appended by _R. J. Mathar_, Apr 18 2010