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.

Showing 1-1 of 1 results.

A338624 a(n) is the length of the longest block of consecutive terms appearing twice (possibly with overlap) among the first n terms of the Kolakoski sequence (A000002).

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 4, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 10, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 16, 17, 18, 18
Offset: 1

Views

Author

Rémy Sigrist, Nov 04 2020

Keywords

Comments

This sequence is weakly increasing and unbounded (as A000002 is bounded).

Crossrefs

Cf. A000002, A338623 (Thue-Morse variant).

Programs

  • PARI
    See Links section.

Formula

a(n) <= a(n+1) <= a(n) + 1.
Showing 1-1 of 1 results.