|
Search: id:A079944
|
|
|
| A079944 |
|
A run of 2^n 0's followed by a run of 2^n 1's, for n=0, 1, 2, ... |
|
+0
105
|
|
| 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
With offset 2, this is the second bit in the binary expansion of n. [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Feb 13 2009]
|
|
LINKS
|
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
FORMULA
|
a(n) = floor(log[2](4*(n+2)/3)) - floor(log[2](n+2)). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 22 2003
For n >= 2, a(n-2)=1+floor(log[2](n/3))-floor(log[2](n/2)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 03 2003
G.f.: 1/x^2/(1-x) * (1/x + sum(k>=0, x^(3*2^k)-x^2^(k+1))). - Ralf Stephan, Jun 04 2003
|
|
CROSSREFS
|
Cf. A086694, A079882, A079945.
Sequence in context: A104893 A104894 A071986 this_sequence A059652 A108736 A079813
Adjacent sequences: A079941 A079942 A079943 this_sequence A079945 A079946 A079947
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 21 2003
|
|
|
Search completed in 0.003 seconds
|
