|
Search: id:A079882
|
|
|
| A079882 |
|
A run of 2^n 1's followed by a run of 2^n 2's, for n=0, 1, 2, ... |
|
+0
7
|
|
| 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 2, 2, 2, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
In the sequence of nonnegative integers (cf. A001477) substitute all n by 2^floor(n/2) occurrences of (1 + n mod 2); a(n)=A173920(n+2,3) for n>0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 04 2010]
|
|
FORMULA
|
a(n) = floor(log[2](8*(n+2)/3)) - floor(log[2](n+2)). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 22 2003
|
|
MAPLE
|
f1 := n->[seq(1, i=1..2^n)]; f2 := n->[seq(2, i=1..2^n)]; s := []; for i from 0 to 10 do s := [op(s), op(f1(i)), op(f2(i))]; od: s;
|
|
CROSSREFS
|
Partial sums give A079945. Equals 1 + A079944. Cf. A080584.
First differences of A080637.
Sequence in context: A002471 A091243 A037826 this_sequence A014709 A069258 A126207
Adjacent sequences: A079879 A079880 A079881 this_sequence A079883 A079884 A079885
|
|
KEYWORD
|
nonn,easy,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 21 2003
|
|
|
Search completed in 0.002 seconds
|
