|
| |
|
|
A080586
|
|
A run of 3*2^n 1's followed by a run of 3*2^n 2's, for n=0, 1, 2, ...
|
|
2
| |
|
|
1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
FORMULA
| a(n) = ( 3 - (-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) = 1+A079944(A002264(n))=floor(log[2](8*(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(1, 0), f(2, 0), f(1, 1), f(2, 1), f(1, 2), f(2, 2), f(1, 3), f(2, 3)]; f;
|
|
|
CROSSREFS
| Cf. A079948, A080587.
Equals 1 + A080584.
Sequence in context: A102679 A025146 A067397 * A152906 A128522 A025454
Adjacent sequences: A080583 A080584 A080585 * A080587 A080588 A080589
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Feb 23 2003
|
| |
|
|
