|
%I #26 Aug 20 2019 09:25:37
%S 4,5,6,7,8,9,10,12,13,14,15,16,18,19,20,21,22,24,25,26,28,30,31,32,33,
%T 34,36,38,39,40,42,43,44,45,46,48,49,50,52,54,55,56,58,60,61,62,63,64,
%U 66,68,69,70,72,73,74,75,76,78,80,81,82,84,85,86,88,90,91,92,94,96,98
%N Numbers that are the sum of 2 primes.
%C Sequence consists of all primes + 2 and, conjecturally (Goldbach), of all even integers larger than 2. The Goldbach conjecture is that every even number is the sum of two primes. - _Emeric Deutsch_, Jul 14 2004
%H T. D. Noe, <a href="/A014091/b014091.txt">Table of n, a(n) for n = 1..1000</a>
%H David Eisenbud and Brady Haran, <a href="https://www.youtube.com/watch?v=MxiTG96QOxw">Goldbach Conjecture</a>, Numberphile video (2017)
%H T. Estermann, <a href="http://dx.doi.org/10.1112/plms/s2-42.1.501">Proof that every large integer is the sum of two primes and a square</a>, Proc. Lond. Math. Soc. 42 (1937) 501-516.
%p sort({seq(2+ithprime(j),j=1..21)} union {seq(2*k,k=2..ceil(ithprime(21)/2))}); # _Emeric Deutsch_, Jul 14 2004
%t Take[ Union@ Flatten@ Table[ Prime@p + Prime@q, {p, 25}, {q, p}], 71] (* _Robert G. Wilson v_, Aug 31 2008 *)
%o (PARI) isA014091(n)= my(i,p); i=1; p=prime(i); while(p<n, if( isprime(n-p), return(1)); i++; p=prime(i)); 0
%o n=0; for(a=2,100, if(isA014091(a), print(n," ",a); n++)) - _R. J. Mathar_, Aug 20 2006
%o (PARI) is(n)=if(n%2,isprime(n-2),n>2) \\ on Goldbach's conjecture; _Charles R Greathouse IV_, Oct 22 2013
%o (Haskell)
%o a014091 n = a014091_list !! (n-1)
%o a014091_list = filter (\x -> any ((== 1) . a010051) $
%o map (x -) $ takeWhile (< x) a000040_list) [1..]
%o -- _Reinhard Zumkeller_, Oct 15 2014
%Y Complement = A014092.
%Y Cf. A010051, A000040, A157931 (semiprimes).
%K nonn
%O 1,1
%A _N. J. A. Sloane_.
%E More terms from _Robert G. Wilson v_, Aug 31 2008
|
