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.

A331910 Lexicographically earliest sequence of positive terms such that a(n) is the length of the n-th run of consecutive, equal terms and such that no two runs are identical.

Original entry on oeis.org

1, 2, 2, 1, 1, 2, 3, 4, 4, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 4, 5, 6, 3, 3, 5, 5, 6, 6, 7, 7, 8, 7, 9, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Samuel B. Reid, Jan 31 2020

Keywords

Examples

			a(8) and a(9) are 4 because runs of length 2 containing values 1 and 2 appear earlier in the sequence and because a(7) is 3.
		

Crossrefs

Cf. A000002.

Programs

  • PARI
    See Links section.