Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087889
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
3
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; listen)
OFFSET

1,1

COMMENT

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 this_sequence A014710 A055174 A096369

Adjacent sequences: A087886 A087887 A087888 this_sequence 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).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research