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 #16 Jun 24 2018 18:30:49
%S 2,3,7,11,19,29,37,43,79,83,139,149,179,197,251,269,307,349,373,397,
%T 491,683,709,733,829,859,883,971,997,1093,1153,1289,1429,1433,1453,
%U 1511,1531,1549,1637,1699,1721,1931,1993,1999,2029,2053,2063,2161,2203
%N Primes of the form prime(k) - k; or primes arising in A014689.
%H Harry J. Smith, <a href="/A064270/b064270.txt">Table of n, a(n) for n = 1..1000</a>
%t t={}; Do[If[PrimeQ[q=Prime[n]-n], AppendTo[t,q]], {n,378}]; t (* _Jayanta Basu_, May 14 2013 *)
%o (PARI) j=[]; for(n=1,500, if(isprime(prime(n)-n), j=concat(j, prime(n)-n))); j
%o (PARI) { n=0; for (m=1, 10^9, if (isprime(prime(m) - m), write("b064270.txt", n++, " ", prime(m) - m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 11 2009
%Y Cf. A064269.
%K easy,nonn
%O 1,1
%A _Jason Earls_, Sep 23 2001