cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A338626 #11 Nov 09 2020 00:29:14
%S A338626 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 A338626 106,107,108,109,214,215,216,217,218,219,220,221,222,297,298,299,300,
%U A338626 301,339,340,487,719,720,721,722,723,724,725,726,727,728,729,730
%N A338626 a(n) is the least k such that the first k terms of the Kolakoski sequence (A000002) contain a length-n repeated block.
%C A338626 The sequence contains large runs of consecutive integers.
%H A338626 Rémy Sigrist, <a href="/A338626/b338626.txt">Table of n, a(n) for n = 1..9511</a> (terms < 3000000)
%H A338626 Rémy Sigrist, <a href="/A338626/a338626.gp.txt">PARI program for A338626</a>
%H A338626 Rémy Sigrist, <a href="/A338626/a338626.pl.txt">Perl program for A338626</a>
%F A338626 A338624(a(n)) = n.
%e A338626 For n = 2:
%e A338626 - the first 5 terms of Kolakoski sequence are: 1, 2, 2, 1, 1,
%e A338626 - they have no length-2 repeated block,
%e A338626 - the first 6 terms of Kolakoski sequence are: 1, 2, 2, 1, 1, 2,
%e A338626 - they have a length-2 repeated block: 1, 2,
%e A338626 - so a(2) = 6.
%o A338626 (PARI) See Links section.
%o A338626 (Perl) See Links section.
%Y A338626 Cf. A000002, A304588 (Thue-Morse variant), A338624.
%K A338626 nonn
%O A338626 1,1
%A A338626 _Rémy Sigrist_, Nov 04 2020