A139371 Let the binary expansion of n be n = Sum_{k} 2^{r_k}, let e(n) be the number of r_k's that are even, o(n) the number that are odd; sequence lists n such that e(n) <= o(n).

0, 2, 3, 6, 8, 9, 10, 11, 12, 14, 15, 18, 24, 26, 27, 30, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 54, 56, 57, 58, 59, 60, 62, 63, 66, 72, 74, 75, 78, 90, 96, 98, 99, 102, 104, 105, 106, 107, 108, 110, 111, 114, 120, 122, 123, 126

Offset

1,2

Comments

e(n)+o(n) = A000120(n), the binary weight of n. For e(n) = o(n) see A039004.

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Mathematica

q[n_] := Module[{d = Reverse[IntegerDigits[n, 2]]}, Total@ d[[1;; -1;; 2]] <= Total@ d[[2;; -1;; 2]]]; Select[Range[0, 130], q] (* Amiram Eldar, Aug 31 2023 *)

Prog

See link in A139351 for Fortran program.

Crossrefs

Cf. A000120, A139351, A139352, A139353, A139354, A139355, A039004, A139370, A139372, A139373.

Sequence in context: A355296 A138343 A321883 * A335962 A079338 A047405

Adjacent sequences: A139368 A139369 A139370 * A139372 A139373 A139374

Keyword

nonn,base

Author

Nadia Heninger and N. J. A. Sloane, Jun 07 2008

Status

approved