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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025143 Unique sequence a such that a(1) = 2 and r(r(a)) = a != r(a), where for any sequence s of 1's and 2's, r(s(n) := length of n-th run of same symbols in s; r(a) is sequence A025142. 6
2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

C. Kimberling, Problem 90: Run-length sequences, Mathematische Semesterberichte, 44 (1997) 94-95.

CROSSREFS

Differs from A014675 in many entries starting at entry 8.

Sequence in context: A123018 A100429 A049710 * A174314 A080634 A109925

Adjacent sequences:  A025140 A025141 A025142 * A025144 A025145 A025146

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 15 08:09 EST 2012. Contains 205721 sequences.