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.
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
KEYWORD
nonn,base,easy
AUTHOR
Reinhard Zumkeller, Jun 23 2002
STATUS
approved