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 A270646 #14 Oct 09 2020 10:43:03
%S A270646 2,2,1,1,2,2,1,1,2,1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,
%T A270646 1,2,2,1,2,1,1,2,1,1,2,2,1,2,2,1,1,2,1,2,2,1,2,1,1,2,2,1,2,2,1,2,1,1,
%U A270646 2,1,2,2,1,1,2,1,1,2,2,1,2,1,1,2,1,1
%N A270646 The sequence a of 1's and 2's starting with (2,2,1,1) such that a(n) is the length of the (n+2)nd run of a.
%C A270646 See A270641 for a guide to related sequences.
%C A270646 a(1) = 2, so the 3rd run has length 2, so a(5) must be 2 and a(6) = 1.
%C A270646 a(2) = 2, so the 4th run has length 2, so a(7) = 1 and a(8) = 1.
%C A270646 a(3) = 1, so the 5th run has length 1, so a(9) = 2 and a(10) = 1.
%C A270646 Globally, the runlength sequence of a is 2,2,2,2,1,1,2,2,1,1,2,1,2,2,1,1,2,..., and deleting the first 2 terms leaves a = A270646.
%H A270646 Clark Kimberling, <a href="/A270646/b270646.txt">Table of n, a(n) for n = 1..10000</a>
%t A270646 a = {2,2,1,1}; Do[a = Join[a, ConstantArray[If[Last[a] == 1, 2, 1], {a[[n]]}]], {n, 200}]; a (* _Peter J. C. Moses_, Apr 01 2016 *)
%Y A270646 Cf. A000002, A006928, A022300, A270641.
%K A270646 nonn,easy
%O A270646 1,1
%A A270646 _Clark Kimberling_, Apr 07 2016