|
Search: id:A036990
|
|
|
| A036990 |
|
Numbers n such that, in the binary expansion of n, reading from right to left, the number of 1's never exceeds the number of 0's. |
|
+0
10
|
|
| 0, 2, 4, 8, 10, 12, 16, 18, 20, 24, 32, 34, 36, 40, 42, 44, 48, 50, 52, 56, 64, 66, 68, 72, 74, 76, 80, 82, 84, 88, 96, 98, 100, 104, 112, 128, 130, 132, 136, 138, 140, 144, 146, 148, 152, 160, 162, 164, 168, 170, 172, 176, 178, 180, 184, 192, 194, 196, 200, 202, 204
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
H. Niederreiter and M. Vielhaber, Tree complexity and a doubly ..., J. Complexity, 12 (1996), 187-198.
|
|
FORMULA
|
a(n)=2*A095775(n). - Robert G. Wilson v.
|
|
MATHEMATICA
|
fQ[n_] := Block[{od = ev = k = 0, id = Reverse@IntegerDigits[n, 2], lmt = Floor@Log[2, n] + 1}, While[k < lmt && od < ev + 1, If[OddQ@id[[k + 1]], od++, ev++ ]; k++ ]; If[k == lmt && od < ev + 1, True, False]]; Select[ Range[0, 204, 2], fQ@# &] (* Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 11 2007 *)
|
|
CROSSREFS
|
Cf. A036988, A036991, A036992, A061854, A125086.
Each term is 2^n * some term of A014486 (n >= 0).
Sequence in context: A032494 A125953 A047464 this_sequence A097498 A140900 A166936
Adjacent sequences: A036987 A036988 A036989 this_sequence A036991 A036992 A036993
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu).
|
|
|
Search completed in 0.002 seconds
|
