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 A039617 #17 Mar 04 2020 20:03:53 %S A039617 1,0,11,1,2,2,1,3,1,4,1,5,1,6,1,7,1,8,1,9 %N A039617 Solution to a "self-describing sequence" puzzle of Raphael Robinson. %H A039617 J. Sauerberg and L. Shu, <a href="http://www.jstor.org/stable/2974579">The long and the short on counting sequences</a>, Amer. Math. Monthly, 104 (1997), 306-317. %e A039617 From _Eric Angelini_, Mar 03 2020: (Start) %e A039617 This finite sequence must be read like this: %e A039617 there is 1 digit 0 in the sequence; %e A039617 there are 11 digits 1 in the sequence; %e A039617 there are 2 digits 2 in the sequence; %e A039617 there is 1 digit 3 in the sequence; etc. %e A039617 (End) %Y A039617 Cf. A039616. %K A039617 nonn,fini,full %O A039617 0,3 %A A039617 _N. J. A. Sloane_