%I A086694
%S A086694 1,0,1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1,1,
%T A086694 1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,
%U A086694 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0
%N A086694 A run of 2^n 1's followed by a run of 2^n 0's, for n=0, 1, 2, ...
%C A086694 a(n) = 1-A079944(n-1) = 2-A079882(n-1) = A080791(n+1)-A083661(n+1).
%C A086694 First differences of A006165 and, likely, of A078881.
%H A086694 R. Stephan, <a href="somedcgf.html">Some divide-and-conquer sequences 
               ...</a>
%H A086694 R. Stephan, <a href="a079944.ps">Table of generating functions</a>
%F A086694 1 - floor(log2(4*(n+1)/3)) + floor(log2(n+1)).
%F A086694 a(1) = 1, a(2) = 0, a(2n+1) = a(n), a(2n) = a(n-1).
%o A086694 (PARI) a(n)=if(n<3,if(n<2,1,0),if(n%2==0,a(n/2-1),a((n-1)/2)))
%Y A086694 Cf. A005942, A079944.
%Y A086694 Sequence in context: A070829 A118175 A120526 this_sequence A093317 A127253 
               A117944
%Y A086694 Adjacent sequences: A086691 A086692 A086693 this_sequence A086695 A086696 
               A086697
%K A086694 nonn,easy
%O A086694 1,1
%A A086694 Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 12 2003