|
Search: id:A079729
|
|
|
| A079729 |
|
Kolakoski variation using (1,2,3) starting with 1,2. |
|
+0
2
|
|
| 1, 2, 2, 3, 3, 1, 1, 1, 2, 2, 2, 3, 1, 2, 3, 3, 1, 1, 2, 2, 3, 3, 3, 1, 2, 2, 3, 3, 3, 1, 1, 1, 2, 3, 1, 1, 2, 2, 3, 3, 3, 1, 1, 1, 2, 2, 2, 3, 1, 1, 2, 2, 3, 3, 3, 1, 1, 1, 2, 2, 2, 3, 1, 2, 3, 3, 1, 1, 1, 2, 3, 1, 1, 2, 2, 3, 3, 3, 1, 1, 1, 2, 2, 2, 3, 1, 2, 3, 3, 1, 1, 2, 2, 3, 3, 3, 1, 2, 3, 3, 1, 1, 2, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(1)=1 then a(n) is the length of n-th run.
|
|
FORMULA
|
Partial sum sequence is expected to be asymptotic to 2*n.
|
|
EXAMPLE
|
Sequence begins: 1,2,2,3,3,1,1,1,2,2,2,3,1,2,3,3,1,1,2,2, read it as: (1), (2,2), (3,3), (1,1,1), (2,2,2), (3), (1), (2), (3,3), (1,1),... then count the terms in parentheses to get: 1,2,2,3,3,1,1,1,2,2,.. which is the same sequence.
|
|
PROGRAM
|
(PARI) a=[1, 2, 2]; for(n=3, 100, for(i=1, a[n], a=concat(a, 1+((n-1)%3)))); a; [From Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 13 2009]
|
|
CROSSREFS
|
Cf. A000002.
Sequence in context: A164089 A068460 A143797 this_sequence A071859 A105899 A135695
Adjacent sequences: A079726 A079727 A079728 this_sequence A079730 A079731 A079732
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 17 2003
|
|
EXTENSIONS
|
More terms from Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 24 2006
|
|
|
Search completed in 0.002 seconds
|
