The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111091 Successive generations of a Kolakoski(3,1) rule starting with 1 (see A066983). 0
 1, 3, 111, 313, 1113111, 313111313, 11131113131113111, 3131113131113111313111313, 1113111313111311131311131311131113131113111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Terms are palindromic. If b_3(n) denotes the number of 3's in a(n) then b(n) satisfies the recursion: b_3(1)=0, b_3(2)=1 and b_3(n) = b_3(n-1) + b_3(n-2) + (-1)^n so that b_3(2n)=A055588(n) and b_3(2n+1)=A027941(n). If b_1(n) denotes the number of 1's: b_1(1)=1, b_1(2)=0 and b_1(n) = b_1(n-1) + b_1(n-2) - 2*(-1)^n so that b_1(2n)=A004146(n) and b_1(2n+1) = A000032(n-2) - 2. LINKS Table of n, a(n) for n=1..9. FORMULA As n grows, a(2n-1) converges toward A095345 (read as a word) and a(2n) converges toward A095346. EXAMPLE 1 --> 3 --> 111 --> 313 --> 1113111 --> 313111313 CROSSREFS Cf. A111081. Sequence in context: A201001 A243464 A114738 * A301612 A180765 A232769 Adjacent sequences: A111088 A111089 A111090 * A111092 A111093 A111094 KEYWORD nonn AUTHOR Benoit Cloitre, Oct 12 2005 STATUS approved

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

Last modified December 4 05:42 EST 2023. Contains 367541 sequences. (Running on oeis4.)