Search: id:A014091
Results 1-1 of 1 results found.

%I A014091
%S A014091 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 A014091 34,36,38,39,40,42,43,44,45,46,48,49,50,52,54,55,56,58,60,61,62,63,64,
%U A014091 66,68,69,70,72,73,74,75,76,78,80,81,82,84,85,86,88,90,91,92,94,96,98
%N A014091 Numbers that are the sum of 2 primes.
%C A014091 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 (deutsch(AT)duke.poly.edu), 
               Jul 14 2004
%H A014091 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 A014091 sort({seq(2+ithprime(j),j=1..21)} union {seq(2*k,k=2..ceil(ithprime(21)/
               2))}); (Deutsch)
%t A014091 Take[ Union@ Flatten@ Table[ Prime@p + Prime@q, {p, 25}, {q, p}], 71] 
               - Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 31 2008
%o A014091 (PARI) isA014091(n)={ local p ; i=1 ; p=prime(i) ; while(p<n, if( isprime(n-p), 
               return(1) ; ) ; i++ ; p=prime(i) ; ) ; return(0) ; } { n=0 ; for(a=2,
               100, if(isA014091(a), print(n," ",a) ; n++ ; ) ; ) ; } - R. J. Mathar 
               (mathar(AT)strw.leidenuniv.nl), Aug 20 2006
%Y A014091 Complement = A014092.
%Y A014091 Sequence in context: A039128 A162706 A088331 this_sequence A030791 A039091 
               A120181
%Y A014091 Adjacent sequences: A014088 A014089 A014090 this_sequence A014092 A014093 
               A014094
%K A014091 nonn
%O A014091 1,1
%A A014091 N. J. A. Sloane (njas(AT)research.att.com).
%E A014091 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 31 2008

Search completed in 0.001 seconds