0,1

For n>=0, let f_1(n) be the number of 1's in a(n) (sequence begins : 0,0,2,3,4,6,11,17,24,...) and f_2(n) be the number of 2's (sequence begins :1,2,2,3,5,8,11,16,25...). Then there is a simple relation between f_1 and f_2, namely : f_1(n)=1-f_2(n)+f_2(n-1)+f_2(n-2)+...+f_2(1)+f_2(0) . i.e. f_1(7)=17 and 1-f_2(7)+f_2(6)+...+f_2(0)=1-16+11+8+5+3+2+2+1=17 - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 11 2005

Bertran Steinsky, A Recursive Formula for the Kolakoski Sequence A000002, Journal of Integer Sequences, Vol. 9 (2006), Article 06.3.7.

Cf. A054348-A054351, A042942, A000002.

Word lengths give A042942.

Sequence in context: A015210 A054948 A113761 this_sequence A113930 A060601 A053952

Adjacent sequences: A054346 A054347 A054348 this_sequence A054350 A054351 A054352

nonn,easy

njas, May 07 2000

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Mar 04 2002