Voozh

A095287

Primes in whose binary expansion the number of 1-bits is <= 1 + number of 0-bits.

2, 5, 17, 19, 37, 41, 67, 71, 73, 83, 89, 97, 101, 113, 131, 137, 139, 149, 163, 193, 197, 257, 263, 269, 271, 277, 281, 283, 293, 307, 313, 331, 337, 353, 389, 397, 401, 409, 419, 421, 433, 449, 457, 521, 523, 541, 547, 557, 563, 569, 577, 587, 593, 601, 613

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Indranil Ghosh, Table of n, a(n) for n = 1..25000

A. Karttunen and J. Moyer: C-program for computing the initial terms of this sequence

EXAMPLE

From Indranil Ghosh, Feb 03 2017: (Start)

5 is in the sequence because 5_10 = 101_2. '101' has two 1's and one 0.

17 is in the sequence because 17_10 = 10001_2. '10001' has two 1's and three 0's. (End)

MATHEMATICA

Select[Prime[Range[200]], DigitCount[#, 2, 1]<=1+DigitCount[#, 2, 0]&] (* Harvey P. Dale, Apr 18 2023 *)