|
%I #10 Sep 22 2014 19:50:25
%S 163,409333,9671300983,186521536807,376040154163,459775038913,
%T 485142116713,773464440907,916792710667,982557050143,1087801149583,
%U 1213507492723,1822896797857,2131006835017,3026318319523,4617478214407,5141744558017,6552892412047,6629618954863,6787014897877,7636453217677,7788411508483,8311114648153,8547311473387,8668135024957,9206471763547
%N Primes p such that p + m^2 is prime for all m in {2,4,6,8,10,12,14,16,18,20,22}.
%C All terms are == {7, 13} mod 30.
%C Subsequence of A145741.
%H Zak Seidov, <a href="/A247273/b247273.txt">Table of n, a(n) for n = 1..41</a>
%o (PARI)
%o forprime(p=1,10^12,c=0;for(i=1,11,if(ispseudoprime(p+(2*i)^2),c++));if(c==11,print1(p,", "))) \\ _Derek Orr_, Sep 11 2014
%Y Cf. A049492, A092120, A246842, A247269, A145741.
%K nonn
%O 1,1
%A _Zak Seidov_, Sep 11 2014
|
