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 A248806 #14 Nov 22 2017 01:15:04 %S A248806 2,0,1,2,2,0,1,0,2,1,0,1,2,0,1,0,1,2,2,0,1,2,1,0,1,0,2,2,0,1,2,2,0,1, %T A248806 0,1,2,1,0,2,2,0,1,2,2,0,1,0,2,1,0,1,2,2,0,1,0,1,2,0,1,0,2,1,0,1,0,2, %U A248806 2,0,1,2,1,0,2,2,1,0,1,0,2,2,0,1,2,1,0,1,0,2,1,0,1,2,0,1,0,1,2,1 %N A248806 Number of 2's separating successive 1's in the Kolakoski sequence A000002. %C A248806 Without the zeros, this sequence is equal to the bisection of the Kolakoski sequence A100429 = lengths of runs of 2's in OK sequence. %C A248806 The Oldenburger-Kolakovski sequence can be obtained back (except the initial 1) by the following substitution rules: insert 1 between two successive nonzero values and 0 -> 11, 1 -> 2, 2 -> 22. %H A248806 Jean-Christophe Hervé, <a href="/A248806/b248806.txt">Table of n, a(n) for n = 1..4995</a> %Y A248806 CF. A000002, A100429, A156256. %K A248806 nonn %O A248806 1,1 %A A248806 _Jean-Christophe Hervé_, Oct 14 2014