login
A276675
A repetition-resistant sequence.
1
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,5
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
CROSSREFS
Cf. A079101.
Sequence in context: A362425 A159459 A304095 * A236389 A337821 A143078
KEYWORD
nonn
AUTHOR
Max Barrentine, Sep 13 2016
STATUS
approved