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 A249603 #17 Nov 08 2014 09:27:57 %S A249603 1,2,0,2,1,1,0,2,2,1,0,2,1,1,0,2,1,0,2,2,1,0,1,1,2,0,1,2,0,1,2,2,0,1, %T A249603 2,0,2,1,0,1,2,0,2,2,1,0,1,2,0,2,1,0,1,2,1,0,2,1,0,2,2,0,1,1,1,0,1,1, %U A249603 0,2,2,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,1 %N A249603 A084937 mod 3. %C A249603 By definition of A084937 this cannot contain two consecutive 0's. So the 0's divide this sequence into runs of 1's and 2's. In the first 100000 terms the following runs of 1's and 2's appear: 11, 12, 21, 22, 111, 112, 121, 122, 211, 212, 221, 222, 1112, 1121, 1122, 1212, 1221, 2111, 2112, 2121, 2211, 2212, 2221. There is no obvious structure. - _N. J. A. Sloane_, Nov 07 2014 %H A249603 Reinhard Zumkeller, <a href="/A249603/b249603.txt">Table of n, a(n) for n = 1..100000</a> %o A249603 (Haskell) %o A249603 a249603 = flip mod 3 . a084937 -- _Reinhard Zumkeller_, Nov 04 2014 %Y A249603 Cf. A084937. %K A249603 nonn %O A249603 1,2 %A A249603 _N. J. A. Sloane_, Nov 03 2014