|
| |
|
|
A157129
|
|
a(n)=(length of n-th run divided by 2) using 1 and 2 and starting with 1,1.
|
|
1
| |
|
|
1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
FORMULA
| As for the Kolakoski sequence we suspect sum(k=1,n,a(k))=(3/2)*n+o(n)
|
|
|
EXAMPLE
| Third run = 1,1,1,1 of length 4 thus a(3)=4/2=2.
|
|
|
PROG
| (PARI) ?w=[1, 1]; for(n=2, 1000, for(i=1, w[n], w=concat(w, 1+(n+1)%2)); w; ) ?a(n)=w[n]
|
|
|
CROSSREFS
| Cf. A000002
Sequence in context: A099384 A015716 A101598 * A101615 A140193 A073741
Adjacent sequences: A157126 A157127 A157128 * A157130 A157131 A157132
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit784c(AT)orange.fr), Feb 23 2009
|
| |
|
|
