|
%I #8 Oct 31 2013 17:29:17
%S 3,3,3,3,3,5,3,7,3,3,3,5,3,3,7,3,3,13,3,5,3,7,3,3,3,3,11,7,5,3,7,5,7,
%T 3,3,5,3,3,7,5,3,3,7,17,11,3,3,5,3,19,5,3,3,3,7,3,3,13,5,7,3,3,17,7,3,
%U 5,3,5,3,7,3,3,5,3,37,11,19,5,7,5,13,3,5,3,7,3,3,23,37,31,11,43,5,3,7,13,17
%N Smallest odd prime q such that 2q + prime(n) is prime.
%H Reinhard Zumkeller, <a href="/A114227/b114227.txt">Table of n, a(n) for n = 3..10000</a>
%t Table[p1 = Prime[n1]; n2 = 2; p2 = 3; While[ cp = p1 + 2*p2; ! PrimeQ[cp], n2++; p2 = Prime[n2]]; p2, {n1, 3, 202}]
%o (Haskell)
%o a114227 n = head [p | p <- tail a000040_list,
%o a010051' (2 * p + a000040 n) == 1]
%o -- _Reinhard Zumkeller_, Oct 29 2013
%Y Cf. A000040, A010051, A114228.
%K easy,nonn
%O 3,1
%A _Lei Zhou_, Nov 18 2005
|
