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 A056062 #27 Aug 12 2019 17:41:17
%S A056062 1,2,1,3,2,1,1,3,1,4,3,1,2,2,1,1,1,1,1,4,2,2,1,4,1,5,4,1,3,2,2,1,1,1,
%T A056062 2,3,1,1,2,1,1,1,1,2,1,2,1,1,1,5,3,2,2,3,1,1,1,2,1,5,2,3,1,5,1,6,5,1,
%U A056062 4,2,3,1,1,1,3,3,2,1,2,1,2,1,1,2,2,2,1,1,2,4,1,1,3,1,1,1,2,2,1,1,1,1,1,1,1,1
%N A056062 Run lengths in infinite binary Champernowne string (A030190) formed by concatenation of 0, 1, 2 ... in base 2.
%H A056062 Reinhard Zumkeller, <a href="/A056062/b056062.txt">Table of n, a(n) for n = 0..10000</a>
%e A056062 The string starts with 011011100101110111... (concatenation of 0, 1, 10, 11, 100, 101, 110, 111, ...) so initial runs are 1, 2, 1, 3, ...
%t A056062 Length /@ (Split@(Join @@ Table[ IntegerDigits[i, 2], {i, 0, 100}])) (* _Olivier Gérard_, Mar 27 2011 *)
%t A056062 Length/@Split[Flatten[IntegerDigits[Range[0,50],2]]] (* _Harvey P. Dale_, May 24 2015 *)
%o A056062 (Haskell)
%o A056062 import Data.List (group)
%o A056062 a056062 n = a056062_list !! n
%o A056062 a056062_list = map length $ group a030190_list
%o A056062 -- _Reinhard Zumkeller_, Mar 26 2013
%Y A056062 Cf. A030190, A003607, A030306, A318924.
%K A056062 easy,nonn,nice,base
%O A056062 0,2
%A A056062 Helge Robitzsch (hrobi(AT)math.uni-goettingen.de), Jul 27 2000
%E A056062 Edited by _Charles R Greathouse IV_, Apr 26 2010
%E A056062 Data corrected for n > 44 by _Reinhard Zumkeller_, Mar 26 2013