|
%I #23 Mar 15 2017 20:24:37
%S 0,2,4,8,10,12,16,18,20,24,32,34,36,40,42,44,48,50,52,56,64,66,68,72,
%T 74,76,80,82,84,88,96,98,100,104,112,128,130,132,136,138,140,144,146,
%U 148,152,160,162,164,168,170,172,176,178,180,184,192,194,196,200,202,204
%N 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.
%C A036989(a(n)) = 1. - _Reinhard Zumkeller_, Jul 31 2013
%H Reinhard Zumkeller, <a href="/A036990/b036990.txt">Table of n, a(n) for n = 1..10000</a>
%H H. Niederreiter and M. Vielhaber, <a href="http://dx.doi.org/10.1006/jcom.1996.0014">Tree complexity and a doubly exponential gap between structured and random sequences</a>, J. Complexity, 12 (1996), 187-198.
%F a(n) = 2*A095775(n). - _Robert G. Wilson v_
%t 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_, Jan 11 2007 *)
%t (* b = A036989 *) b[0] = 1; b[n_?EvenQ] := b[n] = Max[b[n/2]-1, 1]; b[n_] := b[n] = b[(n-1)/2]+1; Select[Range[0, 300, 2], b[#] == 1 &] (* _Jean-François Alcover_, Nov 05 2013, after _Reinhard Zumkeller_ *)
%o (Haskell)
%o a036990 n = a036990_list !! (n-1)
%o a036990_list = filter ((== 1) . a036989) [0..]
%o -- _Reinhard Zumkeller_, Jul 31 2013
%Y Cf. A036988, A036991, A036992, A061854, A125086.
%Y Each term is 2^n * some term of A014486 (n >= 0).
%Y Cf. A030308.
%K nonn,easy,base
%O 1,2
%A _N. J. A. Sloane_.
%E More terms from _Erich Friedman_.
|
