|
Search: id:A080584
|
|
|
| A080584 |
|
A run of 3*2^n 0's followed by a run of 3*2^n 1's, for n=0, 1, 2, ... |
|
+0
6
|
|
| 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
FORMULA
|
a(n) = (1 - (-1)^A079944(A002264(n)) )/2, A079944(A002264(n))=floor(log[2](4*(floor((n+6)/3))/3)) - floor(log[2](floor((n+6)/3))) - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 24 2003
Also a(n) = A079944(A002264(n)) = floor(log[2](4*(floor((n+6)/3))/3)) - floor(log[2](floor((n+6)/3))) - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 24 2003
|
|
MAPLE
|
f := (c, n)->seq(c, i = 1..3*2^n); [f(0, 0), f(1, 0), f(0, 1), f(1, 1), f(0, 2), f(1, 2), f(0, 3), f(1, 3)]; f;
|
|
CROSSREFS
|
Equals A080586 - 1.
Sequence in context: A135461 A093383 A093384 this_sequence A118953 A023970 A072626
Adjacent sequences: A080581 A080582 A080583 this_sequence A080585 A080586 A080587
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 23 2003
|
|
|
Search completed in 0.002 seconds
|
