cp's OEIS Frontend

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.

A164518 Primes of the form A162143(k) + 2.

This page as a plain text file.
%I A164518 #11 Jun 05 2018 22:34:38
%S A164518 11027,65027,74531,119027,184043,308027,314723,370883,423803,603731,
%T A164518 783227,804611,815411,915851,938963,1238771,1279163,1461683,1490843,
%U A164518 1535123,1550027,1718723,2556803,2673227,2812331,3059003,3493163
%N A164518 Primes of the form A162143(k) + 2.
%C A164518 Primes of the form 2 + q^2*r^2*s^2 where q, r, and s are three distinct primes.
%H A164518 Robert Israel, <a href="/A164518/b164518.txt">Table of n, a(n) for n = 1..10000</a>
%e A164518 a(1) = 11027 = A000040(1337) = A162143(7) + 2.
%p A164518 N:= 10^7: # to get all terms <= N
%p A164518 P:= select(isprime, [seq(i,i=3..floor(sqrt(N-2)/15))]):
%p A164518 R:= NULL:
%p A164518 for i from 1 to nops(P) do
%p A164518   for j from 1 to i-1 while (3*P[i]*P[j])^2<=N-2 do
%p A164518     for k from 1 to j-1 do
%p A164518       p:= (P[i]*P[j]*P[k])^2+2;
%p A164518       if p > N then break fi;
%p A164518       if isprime(p) then R:= R, p fi
%p A164518 od od od:
%p A164518 sort([R]); # _Robert Israel_, Jun 05 2018
%t A164518 f[n_]:=FactorInteger[n][[1,2]]==2&&Length[FactorInteger[n]]==3&&FactorInteger[n][[2, 2]]==2&&FactorInteger[n][[3,2]]==2; lst={};Do[p=Prime[n];If[f[p-2], AppendTo[lst,p]],{n,4,9!}];lst
%t A164518 With[{nn=30},Take[Union[Select[Times@@(#^2)+2&/@Subsets[Prime[ Range[ nn]], {3}],PrimeQ]],nn]] (* _Harvey P. Dale_, Mar 14 2016 *)
%Y A164518 Cf. A056899, A162143, A164517.
%K A164518 nonn
%O A164518 1,1
%A A164518 _Vladimir Joseph Stephan Orlovsky_, Aug 14 2009
%E A164518 Edited by _R. J. Mathar_, Aug 21 2009