OFFSET
1,1
LINKS
Indranil Ghosh, Table of n, a(n) for n = 1..20000
A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence
EXAMPLE
73 is in the sequence because 73 is a prime and 73_10 = 1001001_2. '1001001' has four 0's and one 1. - Indranil Ghosh, Jan 31 2017
MATHEMATICA
Reap[Do[p=Prime[k]; id=IntegerDigits[p, 2]; n=Length@id; If[Count[id, 0]>n/2, Sow[p]], {k, 200}]][[2, 1]]
(* Zak Seidov *)
PROG
(PARI) B(x) = { nB = floor(log(x)/log(2)); b1 = 0; b0 = 0;
for(i = 0, nB, if(bittest(x, i), b1++; , b0++; ); );
if(b0 > b1, return(1); , return(0); ); };
forprime(x = 2, 1171, if(B(x), print1(x, ", "); ); ); \\ Washington Bomfim, Jan 11 2011
(PARI){forprime(p=2, 1171, nB=floor(log(p)/log(2));
sum(i=0, nB, bittest(p, i))<=nB/2&print1(p, ", "))} \\ Zak Seidov, Jan 11 2011
(Python)
#Program to generate the b-file
from sympy import isprime
i=1
j=1
while j<=200:
if isprime(i) and bin(i)[2:].count("0")>bin(i)[2:].count("1"):
print(str(j)+" "+str(i))
j+=1
i+=1 # Indranil Ghosh, Jan 31 2017
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Antti Karttunen, Jun 01 2004
STATUS
approved