This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A276675 #5 Sep 26 2016 20:53:14 %S A276675 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 A276675 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 A276675 1,0,1,0,0,1,0,3,1,0,1,0,1,1,0,0,0,2,0 %N A276675 A repetition-resistant sequence. %C A276675 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 A276675 Does every finite permutation of the natural numbers occur in this sequence? %H A276675 Max Barrentine, <a href="/A276675/b276675.txt">Table of n, a(n) for n = 1..766</a> %Y A276675 Cf. A079101. %K A276675 nonn %O A276675 1,5 %A A276675 _Max Barrentine_, Sep 13 2016