login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A173664 Sums of 2 primes that are not product of 2 primes. 1

%I #22 Feb 09 2013 21:48:54

%S 5,7,8,12,13,16,18,19,20,24,28,30,31,32,36,40,42,43,44,45,48,50,52,54,

%T 56,60,61,63,64,66,68,70,72,73,75,76,78,80,81,84,88,90,92,96,98,99,

%U 100,102,103,104,105,108,109,110,112,114,116,120,124,126

%N Sums of 2 primes that are not product of 2 primes.

%H Alois P. Heinz, <a href="/A173664/b173664.txt">Table of n, a(n) for n = 1..1000</a>

%F A014091 \ A001358. - _R. J. Mathar_, Nov 24 2010

%p a:= proc(n) option remember; local k;

%p if n=1 then 5

%p else for k from a(n-1)+1 do

%p if add (i[2], i=ifactors(k)[2])=2 then next fi;

%p if irem (k, 2)=0 or isprime (k-2) then break fi

%p od; k

%p fi

%p end:

%p seq (a(n), n=1..60); # _Alois P. Heinz_, Nov 24 2010

%t Select[Union[Flatten[Table[Prime[i] + Prime[j], {i, 25}, {j, 25}]]], PrimeOmega[#] != 2 &] (* _Alonso del Arte_, Feb 08 2013 *)

%o (PARI) is(n)=if(n%2,isprime(n-2)&&bigomega(n)!=2,n>2&&!isprime(n/2)) \\ above 4 * 10^18, conditional on the Goldbach conjecture _Charles R Greathouse IV_, Feb 09 2013

%Y Cf. A157931, A089268.

%K nonn

%O 1,1

%A _Juri-Stepan Gerasimov_, Nov 24 2010

%E More terms from _Alois P. Heinz_, Nov 24 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)