|
%I #14 Apr 27 2019 05:21:36
%S 2,3,11,59,131,179,347,1259,1571,1979,2027,2411,2699,2819,3251,3347,
%T 4211,5051,5099,5171,5531,6779,7187,8747,10091,12227,13259,13451,
%U 13499,13931,14411,14771,15131,15467,16451,16691,17987,18131,18539,18731,18899,19211
%N Primes p such that p1 = ceiling(p/2) + p is prime and p2 = floor(p1/2) + p is prime.
%C All terms after 2 are congruent to 3 mod 8, as this is needed for p, p1 and p2 to be odd. If p = 3 + 8*k, then p1 = 5 + 12*k and p2 = 5 + 14*k.
%H Robert Israel, <a href="/A242366/b242366.txt">Table of n, a(n) for n = 1..10000</a>
%e 11 is in the sequence since 11, ceiling(11/2) + 11 = 17 and floor(17/2) + 11 = 19 are all primes.
%p N:= 100000: # to get all terms <= N
%p filter:= proc(p) local p1, p2;
%p if not isprime(p) then return false fi;
%p p1:= ceil(p/2)+p;
%p if not isprime(p1) then return false fi;
%p p2:= floor(p1/2)+p;
%p isprime(p2);
%p end;
%p select(filter,[2, seq(3+8*k, k=0 .. floor((N-3)/8))]);
%t M = 100000;
%t filterQ[p_] := Module[{p1, p2},
%t If[!PrimeQ[p], Return[False]];
%t p1 = Ceiling[p/2] + p;
%t If[!PrimeQ[p1], Return[False]];
%t p2 = Floor[p1/2] + p;
%t PrimeQ[p2]];
%t Select[Join[{2}, Table[3+8*k, {k, 0, Floor[(M-3)/8]}]], filterQ] (* _Jean-François Alcover_, Apr 27 2019, from Maple *)
%Y Cf. A158714.
%K nonn
%O 1,1
%A _Robert Israel_ and _Vladimir Joseph Stephan Orlovsky_, May 11 2014
|
