login

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”).

Prime(n)+q, where q is the next prime such that q mod 4 = (prime(n)+2) mod 4.
1

%I #4 Mar 31 2012 13:21:56

%S 8,12,20,24,32,36,48,52,60,68,80,84,96,100,112,120,128,140,144,152,

%T 168,172,192,200,204,212,216,236,240,264,268,276,288,300,308,320,336,

%U 340,352,360,372,384,392,396,428,440,452,456,468,472,480,492,508,520,532

%N Prime(n)+q, where q is the next prime such that q mod 4 = (prime(n)+2) mod 4.

%e Prime(4) = 7, (7+2) mod 4 = 1, 11 mod 4 = 3, 13 mod 4 = 1, hence a(4) = 7+13 = 20.

%o (PARI) {forprime(p=3,270,m=(p+2)%4; q=nextprime(p+1); while(q%4!=m,q=nextprime(q+1)); print1(p+q,","))}

%Y Cf. A084487.

%K nonn

%O 2,1

%A _Jon Perry_, May 28 2003

%E Edited and extended by _Klaus Brockhaus_, May 28 2003