|
Search: id:A133162
|
|
|
| A133162 |
|
Trajectory of 1 under the morphism 1 -> 1,1,2,1, 2 -> 2. |
|
+0
2
|
|
| 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
It can be shown that this is lim_{t -> oo} S_t, where S_0 = 1, S_{t+1} = S_t S_t 2 S_t.
|
|
FORMULA
|
Denote the sequence by a(1), a(2), ...
Block t, that is, S_t, extends from n=1 through n=(3^(t+1)-1)/2.
Given n, to find a(n): first find t from
p = (3^t-1)/2 < n <= (3^(t+1)-1)/2.
Then if n=3^t, a(n) = 2. Otherwise, a(n) = a(n'), where
n' = n-p if n<3^t, otherwise n' = n-2p-1.
|
|
CROSSREFS
|
Suggested by A131989: a(n) = length of n-th run of 1's in A131989.
Sequence in context: A133831 A066955 A089048 this_sequence A079806 A045887 A056832
Adjacent sequences: A133159 A133160 A133161 this_sequence A133163 A133164 A133165
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Oct 09 2007, Oct 10 2007
|
|
|
Search completed in 0.002 seconds
|
