OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harry J. Smith)
FORMULA
MATHEMATICA
Prime[ Select[ Range[ 10^3 ], Count[ IntegerDigits[ Prime[ # ], 2 ], 0 ] == Count[ IntegerDigits[ Prime[ # ], 2 ], 1 ] & ] ]
digBalQ[n_] := Module[{d = IntegerDigits[n, 2], m}, EvenQ@(m = Length@d) && Count[d, 1] == m/2]; Select[Range[3000], PrimeQ[#] && digBalQ[#] &] (* Amiram Eldar, Nov 21 2020 *)
PROG
(PARI) isok(p) = isprime(p) && (2*hammingweight(p) == #binary(p)); \\ Michel Marcus, May 16 2022
(Python)
from itertools import count, islice
from sympy import isprime
from sympy.utilities.iterables import multiset_permutations
def agen():
yield from filter(isprime, (int("1"+"".join(p), 2) for n in count(1) for p in multiset_permutations("0"*n+"1"*(n-1))))
print(list(islice(agen(), 50))) # Michael S. Branicky, May 15 2022
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Robert G. Wilson v, Dec 15 2001
STATUS
approved