Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Jul 02 2018 12:41:25
%S 1,3,9,15,27,31,33,39,47,57,61,63,69,75,91,93,99,105,115,117,123,135,
%T 141,147,151,159,167,177,183,185,189,195,199,213,217,219,225,237,245,
%U 251,257,267,271,273,279,297,301,303,309,325,341,345,361,367,375
%N Numbers n such that 2p-n is prime, p is the smallest prime > n.
%H Charles R Greathouse IV, <a href="/A087031/b087031.txt">Table of n, a(n) for n = 1..10000</a>
%e 3 is a term because smallest prime >3 is 5 and 2*5-3=7 is prime.
%t Select[Range[400],PrimeQ[2*NextPrime[#]-#]&] (* _Harvey P. Dale_, Jul 02 2018 *)
%o (PARI) isok(n) = isprime(2*nextprime(n+1) - n); \\ _Michel Marcus_, Oct 03 2013
%Y Cf. A087030.
%K easy,nonn
%O 1,2
%A _Zak Seidov_, Jul 31 2003
%E Corrected by _Michel Marcus_, Oct 03 2013