|
Search: id:A079730
|
|
|
| A079730 |
|
Kolakoski variation using (1,2,3,4) starting with 1,2. |
|
+0
2
|
|
| 1, 2, 2, 3, 3, 4, 4, 4, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 1, 1, 1, 1, 2, 3, 4, 1, 1, 2, 2, 3, 3, 4, 4, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 1, 2, 3, 4, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 1, 2, 2, 3, 3, 4, 4, 4, 1, 1, 1, 2, 3, 4, 1, 1, 2, 2, 3, 3, 4, 4, 4, 1, 1, 1, 2, 2, 2, 3, 4, 4, 1, 1, 1, 2, 2, 2, 2, 3, 4, 1, 1, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(1)=1 then a(n) is the length of n-th run. This kind of Kolakoski variation using(1,2,3,4,...,m) as m grows reaches the Golomb's sequence A001462.
|
|
FORMULA
|
Partial sum sequence is expected to be asymptotic to 5/2*n.
|
|
EXAMPLE
|
Sequence begins: 1,2,2,3,3,4,4,4,1,1,1,2,2,2,2,3,3,3,3, read it as: (1),(2,2),(3,3),(4,4,4),(1,1,1),(2,2,2,2),(3,3,3,3),... then count the terms in parentheses to get: 1,2,2,3,3,4,4,.. which is the same sequence.
|
|
CROSSREFS
|
Cf. A000002.
Adjacent sequences: A079727 A079728 A079729 this_sequence A079731 A079732 A079733
Sequence in context: A036041 A085654 A074719 this_sequence A035486 A143489 A130249
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 17 2003
|
|
|
Search completed in 0.002 seconds
|
