|
|
A087889
|
|
Given a sequence u consisting just of 1's and 2's, let f(u)(n) be the length of n-th run. Then we may define a sequence u = {a(n)} by a(n)=f^(n-1)(u)(1) (starting with n=1).
|
|
2
|
|
|
2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
There are exactly three infinite sequences satisfying this relation, namely this sequence, A087888 and A087890.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,eigen,nonn
|
|
AUTHOR
|
Vincent Nesme (vincent.nesme(AT)ens-lyon.fr), Oct 13 2003
|
|
EXTENSIONS
|
The description was not quite clear to me but I hope I have edited it correctly. - N. J. A. Sloane.
|
|
STATUS
|
approved
|
|
|
|