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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054349 Successive generations of the variant of the Kolakoski sequence described in A042942. 4
2, 22, 2211, 221121, 221121221, 22112122122112, 2211212212211211221211, 221121221221121122121121221121121, 2211212212211211221211212211211212212211212212112 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

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

REFERENCES

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

CROSSREFS

Cf. A054348-A054351, A042942, A000002.

Word lengths give A042942.

Sequence in context: A054948 A104149 A113761 * A113930 A181235 A060601

Adjacent sequences:  A054346 A054347 A054348 * A054350 A054351 A054352

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 07 2000

EXTENSIONS

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

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 14 06:58 EST 2012. Contains 205577 sequences.