|
| |
|
|
A079730
|
|
Kolakoski variation using (1,2,3,4) starting with 1,2.
|
|
1
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 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.
Sequence in context: A036041 A085654 A074719 * A035486 A172397 A143489
Adjacent sequences: A079727 A079728 A079729 * A079731 A079732 A079733
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 17 2003
|
| |
|
|
