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 A079336 #8 Feb 14 2024 12:38:21 %S A079336 0,1,1,0,0,1,0,1,1,1,1,0,1,0,0,0,1,1,1,0,0,0,0,1,0,0,1,1,0,1,1,0,1,0, %T A079336 1,1,0,0,0,1,0,1,0,1,0,0,1,0,0,0,0,0,1,1,0,0,1,1,1,1,1,1,1,0,1,1,1,1, %U A079336 1,0,0,1,1,0,0,0,0,0,0,1,0,1,1,0,1,1,1,0,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,1 %N A079336 A repetition-resistant sequence. %C A079336 Unsolved problem: is every finite binary sequence a segment of a? %H A079336 Clark Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/unsolved.html">Unsolved Problems and Rewards</a>. %H A079336 Clark Kimberling, <a href="https://cms.math.ca/wp-content/uploads/crux-pdfs/CRUXv23n8.pdf">Problem 2289</a>, Crux Mathematicorum 23 (1997) 501. %F A079336 a(n+1)=0 if and only if (a(1), a(2), ..., a(n), 1), but not (a(1), a(2), ..., a(n), 0), has greater length of longest repeated segment than (a(1), a(2), ..., a(n)) has. %e A079336 a(8)=1 because (0,1,1,0,0,1,0,0) has repeated segment (1,0,0) of length 3, whereas (0,1,1,0,0,1,0,1) has no repeated segment of length 3. %Y A079336 Cf. A079101, A079136, A079335, A079337, A079338. %K A079336 nonn %O A079336 1,1 %A A079336 _Clark Kimberling_, Jan 03 2003