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 #13 Jun 25 2018 02:56:30
%S 41,251,991,1471,2551,3301,4211,4721,4931,5167,5581,5791,7351,8317,
%T 8581,9157,9781,11701,12517,13093,15541,16741,16927,17341,18301,18397,
%U 19121,19231,20411,22571,23911,24151,25741,26293,26317,26681,27031
%N Numbers p from A001125 such that 2*p-3 is prime.
%H Harry J. Smith, <a href="/A063939/b063939.txt">Table of n, a(n) for n = 1..1000</a>
%o (PARI) j=[]; forprime(p=3,40000, if(znprimroot(p)==6, if(isprime(2*p- 3),j=concat(j,p)))); j
%o (PARI) { n=0; p=0; for (m=1, 10^9, p=nextprime(p+1); if (znprimroot(p)==6 && isprime(2*p - 3), write("b063939.txt", n++, " ", p); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 03 2009
%Y Cf. A001125.
%K easy,nonn
%O 1,1
%A _Jason Earls_, Aug 31 2001