The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049705 a(n)=3-k(n), where k=A000002=Kolakoski sequence; also the sequence of runlengths of a is k. 5
 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The anti-Kolakoski sequence: a(n) never equals the length of the n-th run. Start with a(1)=2, then the first run is of length 1 and a(2)=1; thus the 2nd run is of length 2 and a(3)=1, thus a(4)=a(5)=2, etc. - Jean-Christophe Hervé, Nov 10 2014 LINKS MATHEMATICA a2 = {1, 2, 2}; Do[ a2 = Join[a2, {1 + Mod[n-1, 2]}], {n, 3, 70}, {i, 1, a2[[n]]}]; 3 - a2 (* Jean-François Alcover, Jun 18 2013 *) CROSSREFS Cf. A088569 (essentially the same sequence). Sequence in context: A264714 A265209 A202340 * A060236 A006345 A122497 Adjacent sequences:  A049702 A049703 A049704 * A049706 A049707 A049708 KEYWORD nonn AUTHOR STATUS approved

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

Last modified January 29 07:03 EST 2020. Contains 331337 sequences. (Running on oeis4.)