OFFSET
1,1
MATHEMATICA
a = {}; For[n = 1, n <= 1000, n++, If[PrimeQ[n], {d = Reverse[ IntegerDigits[n, 2]]; If[!PrimeQ[FromDigits[d, 2]], AppendTo[a, n]]}]]; a (* Hasler *)
Select[Prime[Range[170]], Not[PrimeQ[FromDigits[Reverse[IntegerDigits[#, 2]], 2]]] &] (* Alonso del Arte, Jan 13 2012 *)
PROG
(PARI) forprime(p=1, 1e3, if(!isprime(sum(i=1, #b=binary(p), b[i]<<i)\2), print1(p", ")))
(PARI) isok(k) = isprime(k) && !isprime(fromdigits(Vecrev(binary(k)), 2)); \\ Michel Marcus, Feb 19 2021
(Python)
from sympy import isprime, primerange
def ok(p): return not isprime(int(bin(p)[:1:-1], 2))
def aupto(lim): return [p for p in primerange(2, lim+1) if ok(p)]
print(aupto(1000)) # Michael S. Branicky, Feb 19 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
M. F. Hasler, Jan 13 2012
STATUS
approved