A276675 A repetition-resistant sequence.

0, 1, 0, 0, 2, 0, 0, 0, 1, 1, 0, 1, 2, 0, 1, 3, 0, 0, 0, 0, 2, 1, 0, 0, 0, 3, 0, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 1, 0, 0, 0, 1, 2, 0, 0, 0, 0, 4, 0, 0, 1, 0, 2, 1, 0, 1, 0, 0, 1, 0, 3, 1, 0, 1, 0, 1, 1, 0, 0, 0, 2, 0

Offset: 1

Author

Max Barrentine, Sep 13 2016

Keywords

• nonn

Comments

a(n) is the smallest term such that the subsequence a(n-k), a(n+1-k), ... a(n) does not occur earlier in the sequence, where k is the largest term in the sequence before a(n).

Does every finite permutation of the natural numbers occur in this sequence?

Links

• Max Barrentine, Table of n, a(n) for n = 1..766

Crossrefs

Cf. A079101.