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!)
A338626 a(n) is the least k such that the first k terms of the Kolakoski sequence (A000002) contain a length-n repeated block. 1

%I #11 Nov 09 2020 00:29:14

%S 3,6,9,10,13,15,16,28,32,33,40,41,42,43,69,70,71,72,94,95,96,97,98,99,

%T 106,107,108,109,214,215,216,217,218,219,220,221,222,297,298,299,300,

%U 301,339,340,487,719,720,721,722,723,724,725,726,727,728,729,730

%N a(n) is the least k such that the first k terms of the Kolakoski sequence (A000002) contain a length-n repeated block.

%C The sequence contains large runs of consecutive integers.

%H Rémy Sigrist, <a href="/A338626/b338626.txt">Table of n, a(n) for n = 1..9511</a> (terms < 3000000)

%H Rémy Sigrist, <a href="/A338626/a338626.gp.txt">PARI program for A338626</a>

%H Rémy Sigrist, <a href="/A338626/a338626.pl.txt">Perl program for A338626</a>

%F A338624(a(n)) = n.

%e For n = 2:

%e - the first 5 terms of Kolakoski sequence are: 1, 2, 2, 1, 1,

%e - they have no length-2 repeated block,

%e - the first 6 terms of Kolakoski sequence are: 1, 2, 2, 1, 1, 2,

%e - they have a length-2 repeated block: 1, 2,

%e - so a(2) = 6.

%o (PARI) See Links section.

%o (Perl) See Links section.

%Y Cf. A000002, A304588 (Thue-Morse variant), A338624.

%K nonn

%O 1,1

%A _Rémy Sigrist_, Nov 04 2020

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 September 1 12:47 EDT 2024. Contains 375591 sequences. (Running on oeis4.)