cp's OEIS Frontend

A088119 Sequence of primes p(n) such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.

%I A088119 #11 Jul 01 2018 10:50:40
%S A088119 193,223,1607,15733,39877,63647,65407,68207,72673,84299,89977,96787,
%T A088119 99137,102533,103687,115837,127807,143567,150373,191999,204793,257867,
%U A088119 324217,344957,375253,412033,427433,491149,551717,595117,642527,646897
%N A088119 Sequence of primes p(n) such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.
%H A088119 Robert Israel, <a href="/A088119/b088119.txt">Table of n, a(n) for n = 1..2000</a>
%F A088119 a(n) = A000040(A088066(n)).
%e A088119 p(44) = 193, 2*193 + 3 = 389 = p(77);
%e A088119 p(45) = 197, 2*197 + 3 = 397 = p(78);
%e A088119 p(46) = 199, 2*199 + 3 = 401 = p(79).
%p A088119 r:= 1: q:= 2: p:= 3: count:= 0:
%p A088119 while count < 100 do
%p A088119   r:= q; q:= p; p:= nextprime(p);
%p A088119   if isprime(2*r+3) and nextprime(2*r+3)=2*q+3 and nextprime(2*q+3)=2*p+3 then
%p A088119     count:= count+1;
%p A088119     A[count]:= r;
%p A088119   fi
%p A088119 od:seq(A[i],i=1..100); # _Robert Israel_, Jul 01 2018
%Y A088119 Subsequence of A089527.
%Y A088119 Cf. A088066, A089450, A089525.
%K A088119 nonn
%O A088119 1,1
%A A088119 _Pierre CAMI_, Nov 02 2003
%E A088119 More terms from _Ray Chandler_, Nov 03 2003
%E A088119 Offset corrected by _Robert Israel_, Jul 01 2018