login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; internal format)
OFFSET

1,1

COMMENTS

There are exactly three infinite sequences satisfying this relation, namely this sequence, A087888 and A087890.

CROSSREFS

Cf. A000002, A087888, A087890.

Sequence in context: A059689 A165018 A131837 * A192064 A014710 A055174

Adjacent sequences:  A087886 A087887 A087888 * A087890 A087891 A087892

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 (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.