A329173 Smallest positive integer such that for any n no substring (subsequence without internal skips) of length n is repeated unless it contains the number n or higher.

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

Offset

1,3

Links

André Engels, Table of n, a(n) for n = 1..10000

Example

After 1,1,2,1,2, the next element is 2, because a 1 would repeat the length 3 substring 1,2,1. A 2 repeats the length 2 substring 2,2, but that's allowed because it contains a 2.

Crossrefs

Sequence in context: A050362 A095686 A105258 * A366493 A352998 A339351

Adjacent sequences: A329170 A329171 A329172 * A329174 A329175 A329176

Keyword

nonn

Author

André Engels, Nov 07 2019

Status

approved