Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Sep 26 2016 20:53:14
%S 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,
%T 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,
%U 1,0,1,0,0,1,0,3,1,0,1,0,1,1,0,0,0,2,0
%N A repetition-resistant sequence.
%C 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).
%C Does every finite permutation of the natural numbers occur in this sequence?
%H Max Barrentine, <a href="/A276675/b276675.txt">Table of n, a(n) for n = 1..766</a>
%Y Cf. A079101.
%K nonn
%O 1,5
%A _Max Barrentine_, Sep 13 2016