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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088569 Anti-Kolakoski sequence (sequence of length runs never coincides with the sequence itself). 0
1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 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, 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, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Unique infinite word defined on alphabet {1,2} satisfying: a(1)=1, if a(n)=2 length of n-th run is 1, if a(n)=1 length of n-th run is 2. Kolakoski sequence satisfies the opposite definition : K(1)=1, if K(n)=2 length of n-th run is 2, if K(n)=1 length of n-th run is 1.

LINKS

Table of n, a(n) for n=1..105.

FORMULA

a(n)=3-A000002(n+1)=A049705(n+1)

EXAMPLE

a(1)=1 hence first run must have length 2 and necessarily a(2)=1. Now second run must have also length 2 and therefore a(3)=a(4)=2.

CROSSREFS

Sequence in context: A164295 A035214 A071292 * A192763 A001285 A088424

Adjacent sequences:  A088566 A088567 A088568 * A088570 A088571 A088572

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Nov 17 2003

STATUS

approved

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

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

Last modified April 25 03:36 EDT 2014. Contains 240994 sequences.