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 A269348 #15 Mar 02 2016 11:20:45
%S A269348 1,6,6,6,6,6,6,1,1,1,1,1,1,6,6,6,6,6,6,1,1,1,1,1,1,6,6,6,6,6,6,1,1,1,
%T A269348 1,1,1,6,1,6,1,6,1,6,6,6,6,6,6,1,1,1,1,1,1,6,6,6,6,6,6,1,1,1,1,1,1,6,
%U A269348 6,6,6,6,6,1,1,1,1,1,1,6,1,6,1,6,1,6,6
%N A269348 Kolakoski-(1,6) sequence: a(n) is length of n-th run.
%C A269348 16666661111, 1666666111111, 1666666111111666666111111666666111111616161666666111111666666111 are primes.
%H A269348 Vincenzo Librandi, <a href="/A269348/b269348.txt">Table of n, a(n) for n = 1..10000</a>
%H A269348 Michael Baake and Bernd Sing, <a href="http://arXiv.org/abs/math.MG/0206098">Kolakoski-(3,1) is a (deformed) model set</a>, arXiv:math/0206098 [math.MG], 2002-2003.
%t A269348 seed = {1, 6}; w = {}; i = 1; Do[w = Join[w, Array[seed[[Mod[i - 1, Length[seed]] + 1]] &, If[i > Length[w], seed, w][[i]]]]; i++, {n, 250}]; w (* from _Ivan Neretin_ in similar sequences *)
%Y A269348 Cf. similar sequences listed in A269268.
%K A269348 nonn,easy
%O A269348 1,2
%A A269348 _Vincenzo Librandi_, Feb 25 2016