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 A269350 #16 Mar 04 2016 02:29:57
%S A269350 1,8,8,8,8,8,8,8,8,1,1,1,1,1,1,1,1,8,8,8,8,8,8,8,8,1,1,1,1,1,1,1,1,8,
%T A269350 8,8,8,8,8,8,8,1,1,1,1,1,1,1,1,8,8,8,8,8,8,8,8,1,1,1,1,1,1,1,1,8,1,8,
%U A269350 1,8,1,8,1,8,8,8,8,8,8,8,8,1,1,1,1,1,1
%N A269350 Kolakoski-(1,8) sequence: a(n) is length of n-th run.
%C A269350 188888888111111118888888811111111 is prime.
%H A269350 Vincenzo Librandi, <a href="/A269350/b269350.txt">Table of n, a(n) for n = 1..10000</a>
%H A269350 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 A269350 seed = {1, 8}; w = {}; i = 1; Do[w = Join[w, Array[seed[[Mod[i - 1, Length[seed]] + 1]]&, If[i > Length[w], seed, w][[i]]]]; i++, {n, 42}]; w
%Y A269350 Cf. similar sequences listed in A269268.
%K A269350 nonn,easy
%O A269350 1,2
%A A269350 _Vincenzo Librandi_, Feb 26 2016