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!)
A346659 Primes that are not of the form p*q +- 2 where p and q are primes (not necessarily distinct). 1

%I #28 Nov 27 2022 01:14:04

%S 3,5,29,43,61,73,101,103,107,137,149,151,173,191,193,197,227,229,241,

%T 271,277,281,283,313,347,349,421,431,433,457,461,463,523,569,601,607,

%U 617,619,641,643,659,661,727,821,823,827,857,859,883,929,1019,1021,1031

%N Primes that are not of the form p*q +- 2 where p and q are primes (not necessarily distinct).

%C Conjecture: this sequence is infinite.

%H Robert Israel, <a href="/A346659/b346659.txt">Table of n, a(n) for n = 1..10000</a>

%e 2 is not a term because 2 = 2*2 - 2.

%e 3 is a term because neither 1 (3-2) nor 5 (3+2) is a product of two primes.

%p q:= n-> andmap(x-> numtheory[bigomega](x)<>2, [n-2, n+2]):

%p select(q, [ithprime(i)$i=1..200])[]; # _Alois P. Heinz_, Jul 30 2021

%t Select[Range[3, 1000], PrimeQ[#] && PrimeOmega[# - 2] != 2 && PrimeOmega[# + 2] != 2 &] (* _Amiram Eldar_, Jul 29 2021 *)

%o (Python)

%o from sympy import factorint, primerange

%o def semiprime(n): return sum(e for e in factorint(n).values()) == 2

%o def ok(p): return not semiprime(p-2) and not semiprime(p+2)

%o def aupto(limit): return list(filter(ok, primerange(1, limit+1)))

%o print(aupto(1031)) # _Michael S. Branicky_, Jul 29 2021

%Y Cf. A207526 (complementary sequence).

%K nonn

%O 1,1

%A _Marcin Barylski_, Jul 27 2021

%E More terms from _Michael S. Branicky_, Jul 29 2021

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 July 20 19:29 EDT 2024. Contains 374459 sequences. (Running on oeis4.)