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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079726 a(1)=1, a(n) is the smallest integer > a(n-1) such that a(n) is even if k(n)=1, a(n) is odd if k(n)=2, where k(n) denotes the n-th term of the Kolakoski sequence (A000002). 0

%I #6 Mar 30 2012 18:39:12

%S 1,2,4,5,7,8,9,10,12,13,14,16,17,19,20,21,23,24,26,27,28,29,31,32,33,

%T 34,36,37,39,40,41,43,44,45,46,48,49,50,52,53,55,56,57,58,60,61,62,63,

%U 65,66,67,69,70,72,73,74,76,77,79,80,81,83,84,85,86,88,89,90,92,93,95,96

%N a(1)=1, a(n) is the smallest integer > a(n-1) such that a(n) is even if k(n)=1, a(n) is odd if k(n)=2, where k(n) denotes the n-th term of the Kolakoski sequence (A000002).

%F a(n) is conjectured to be asymptotic to 4/3*n.

%e Kolakoski sequence begins: 1,2,2,1,1,2,1, ....from the rule, a(2) > a(1)=1 and even, so a(2)=2. a(3)>a(2)=2 and even, so a(3)=4. a(4)>a(3)=4 and odd so a(4)=5...

%Y Cf. A000002.

%K nonn

%O 1,2

%A _Benoit Cloitre_, Feb 17 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:05 EDT 2024. Contains 371962 sequences. (Running on oeis4.)