The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095314 Primes in whose binary expansion the number of 1 bits is > 2 + number of 0 bits. 5
 7, 23, 29, 31, 47, 59, 61, 79, 103, 107, 109, 127, 191, 223, 239, 251, 311, 317, 347, 349, 359, 367, 373, 379, 383, 431, 439, 443, 461, 463, 467, 479, 487, 491, 499, 503, 509, 607, 631, 701, 719, 727, 733, 743, 751, 757, 761, 823, 827, 829, 859 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS A. Karttunen and J. Moyer: C-program for computing the initial terms of this sequence MATHEMATICA n1Q[p_]:=Module[{be=IntegerDigits[p, 2]}, Total[be]>2+Count[be, 0]]; Select[ Prime[ Range[150]], n1Q] (* Harvey P. Dale, Oct 26 2022 *) 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(b1 > (2+b0), return(1); , return(0); ); }; forprime(x = 2, 859, if(B(x), print1(x, ", "); ); ); \\ Washington Bomfim, Jan 12 2011 CROSSREFS Complement of A095315 in A000040. Subset of A095286. Subset: A095318. Cf. also A095334. Sequence in context: A044068 A109992 A070330 * A038948 A019389 A056723 Adjacent sequences: A095311 A095312 A095313 * A095315 A095316 A095317 KEYWORD nonn,base AUTHOR Antti Karttunen, Jun 04 2004 STATUS approved

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.

Last modified December 3 08:35 EST 2022. Contains 358515 sequences. (Running on oeis4.)