|
%I #8 Aug 18 2019 11:28:45
%S 10,18,18,30,30,46,42,54,66,74,78,94,90,106,114,126,134,138,150,162,
%T 162,186,186,198,210,210,234,222,250,258,270,286,290,306,314,330,330,
%U 346,354,370,374,390,390,426,410,434,450,466,462,474,490,498,514,526,534
%N Prime(n)+q, where q is the next prime such that q mod 4 = prime(n) mod 4.
%H Harvey P. Dale, <a href="/A084487/b084487.txt">Table of n, a(n) for n = 2..1000</a>
%e Prime(5) = 11, 11 mod 4 = 3, 13 mod 4 = 1, 17 mod 4 = 1, 19 mod 4 = 3, hence a(5) = 11+19 = 30.
%t nq4[n_]:=Module[{q=NextPrime[n],m=Mod[n,4]},While[Mod[q,4]!=m,q= NextPrime[ q]];n+q]; Table[nq4[n],{n,Prime[Range[2,60]]}] (* _Harvey P. Dale_, Aug 18 2019 *)
%o (PARI) {forprime(p=3,270,m=p%4; q=nextprime(p+1); while(q%4!=m,q=nextprime(q+1)); print1(p+q,","))}
%Y Cf. A084488.
%K nonn
%O 2,1
%A _Jon Perry_, May 28 2003
%E Edited and extended by _Klaus Brockhaus_, May 28 2003
|
