OFFSET
1,1
COMMENTS
It appears that the sequence of odd numbers k*2^m+1 such that k + 2^m is prime (A332075) mainly consists of the primes. This sequence lists the "exceptions": the complement of A332075 within the primes. (The exceptions become more frequent as the numbers grow, the asymptotic density of this subset within the primes might well approach one. See also A332079.)
These are primes of the form p = (w-2^m)*2^m + 1, where w is an odd composite number and 1 < 2^m < w. There are infinitely many primes of this form, because all primes p > 7 such that p == 7 (mod 20) are in this sequence. - Thomas Ordowski, Aug 13 2020
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
T. Ordowski, Problem, post to the SeqFan list, August 2020
MAPLE
filter:= proc(p) local k, m;
if not isprime(p) then return false fi;
m:= padic:-ordp(p-1, 2);
k:= (p-1)/2^m;
not isprime(k+2^m);
end proc:
select(filter, [seq(i, i=3..1000, 2)]); # Robert Israel, Sep 14 2020
MATHEMATICA
Select[Range[1000], PrimeQ[#] && !PrimeQ[(m = 2^IntegerExponent[# - 1, 2]) + (# - 1)/m] &] (* Amiram Eldar, Aug 14 2020 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Aug 13 2020
STATUS
approved