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 A001141 #36 Jul 29 2024 08:24:28
%S A001141 5,15,1115,3115,132115,1113122115,311311222115,13211321322115,
%T A001141 1113122113121113222115,31131122211311123113322115,
%U A001141 132113213221133112132123222115
%N A001141 Describe the previous term! (method A - initial term is 5).
%C A001141 Method A = 'frequency' followed by 'digit'-indication.
%C A001141 A001155, A001140, A001141, A001143, A001145, A001151 and A001154 are all identical apart from the last digit of each term (the seed). This is because digits other than 1, 2 and 3 never arise elsewhere in the terms (other than at the end of each of them) of look-and-say sequences of this type (as is mentioned by _Carmine Suriano_ in A006751). - _Chayim Lowen_, Jul 16 2015
%C A001141 a(n+1) - a(n) is divisible by 10^5 for n > 5. - _Altug Alkan_, Dec 04 2015
%D A001141 S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 452-455.
%D A001141 I. Vardi, Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991, p. 4.
%H A001141 T. D. Noe, <a href="/A001141/b001141.txt">Table of n, a(n) for n=1..20</a>
%H A001141 J. H. Conway, <a href="http://dx.doi.org/10.1007/978-1-4612-4808-8_53">The weird and wonderful chemistry of audioactive decay</a>, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 173-188.
%H A001141 S. R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/constant/cnwy/cnwy.html">Conway's Constant</a> [Broken link]
%H A001141 S. R. Finch, <a href="http://web.archive.org/web/20010207194413 /http://www.mathsoft.com/asolve/constant/cnwy/cnwy.html">Conway's Constant</a> [From the Wayback Machine]
%e A001141 The term after 3115 is obtained by saying "one 3, two 1's, one 5", which gives 132115.
%t A001141 RunLengthEncode[ x_List ] := (Through[ {First, Length}[ #1 ] ] &) /@ Split[ x ];
%t A001141 LookAndSay[ n_, d_:1 ] := NestList[ Flatten[ Reverse /@ RunLengthEncode[ # ] ] &, {d}, n - 1 ];
%t A001141 F[ n_ ] := LookAndSay[ n, 5 ][ [ n ] ];
%t A001141 Table[ FromDigits[ F[ n ] ], {n, 1, 11} ] (* _Zerinvary Lajos_, Mar 21 2007 *)
%Y A001141 Cf. A001155, A005150, A006751, A006715, A001140, A001143, A001145, A001151, A001154.
%K A001141 nonn,base,easy,nice
%O A001141 1,1
%A A001141 _N. J. A. Sloane_