|
| |
|
|
A086694
|
|
A run of 2^n 1's followed by a run of 2^n 0's, for n=0, 1, 2, ...
|
|
1
| |
|
|
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, 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, 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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(n) = 1-A079944(n-1) = 2-A079882(n-1) = A080791(n+1)-A083661(n+1).
First differences of A006165 and, likely, of A078881.
|
|
|
LINKS
| R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
|
FORMULA
| 1 - floor(log2(4*(n+1)/3)) + floor(log2(n+1)).
a(1) = 1, a(2) = 0, a(2n+1) = a(n), a(2n) = a(n-1).
|
|
|
PROG
| (PARI) a(n)=if(n<3, if(n<2, 1, 0), if(n%2==0, a(n/2-1), a((n-1)/2)))
|
|
|
CROSSREFS
| Cf. A005942, A079944.
Sequence in context: A118175 A179762 A120526 * A093317 A127253 A117944
Adjacent sequences: A086691 A086692 A086693 * A086695 A086696 A086697
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 12 2003
|
| |
|
|
