A072603 Numbers which in base 2 have more 0's than 1's.

4, 8, 16, 17, 18, 20, 24, 32, 33, 34, 36, 40, 48, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 76, 80, 81, 82, 84, 88, 96, 97, 98, 100, 104, 112, 128, 129, 130, 131, 132, 133, 134, 136, 137, 138, 140, 144, 145, 146, 148, 152, 160, 161, 162, 164, 168, 176, 192, 193

Offset

1,1

Links

T. D. Noe, Table of n, a(n) for n = 1..5202 (numbers up to 2^14)

Jason Bell, Thomas Finn Lidbetter, Jeffrey Shallit, Additive Number Theory via Approximation by Regular Languages, arXiv:1804.07996 [cs.FL], 2018.

Index entries for sequences related to binary expansion of n

Example

8 is present because '1000' contains 3 '0's and 1 '1': 3>1.

Mathematica

gtQ[n_] := Module[{a, b}, {a, b} = DigitCount[n, 2]; b > a]; Select[Range[2^8], gtQ] (* T. D. Noe, Apr 20 2013 *)
Select[Range[200], DigitCount[#, 2, 0]>DigitCount[#, 2, 1]&] (* Harvey P. Dale, Feb 26 2023 *)

Prog

(Haskell)
a072603 n = a072603_list !! (n-1)
a072603_list = filter ((> 0) . a037861) [1..]
-- Reinhard Zumkeller, Mar 31 2015
(PARI) is(n)=2*hammingweight(n)<exponent(n)+1 \\ Charles R Greathouse IV, Apr 18 2020

Crossrefs

Cf. A007088, A000120, A023416, A072600, A072601, A031443, A072602.

Cf. A037861(a(n)) > 0.

Sequence in context: A189007 A242349 A309521 * A123535 A312765 A065192

Adjacent sequences: A072600 A072601 A072602 * A072604 A072605 A072606

Keyword

nonn,base,easy

Author

Reinhard Zumkeller, Jun 23 2002

Status

approved