A331910 - OEIS

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.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, PARI program for A331910

EXAMPLE

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.

PROG

(PARI) See Links section.

CROSSREFS

Cf. A000002.