|
%I #24 Apr 14 2019 10:26:30
%S 7,17,1117,3117,132117,1113122117,311311222117,13211321322117,
%T 1113122113121113222117,31131122211311123113322117,
%U 132113213221133112132123222117
%N Describe the previous term! (method A - initial term is 7).
%C Method A = 'frequency' followed by 'digit'-indication.
%C a(n+1) - a(n) is divisible by 10^5 for n > 5. - _Altug Alkan_, Dec 04 2015
%D S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 452-455.
%D I. Vardi, Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991, p. 4.
%H T. D. Noe, <a href="/A001145/b001145.txt">Table of n, a(n) for n=1..20</a>
%H 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 S. R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/constant/cnwy/cnwy.html">Conway's Constant</a> [Broken link]
%H 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 E.g. the term after 3117 is obtained by saying "one 3, two 1's, one 7", which gives 132117.
%t RunLengthEncode[x_List] := (Through[{First, Length}[ #1]] &) /@ Split[x]; LookAndSay[n_, d_: 1] := NestList[Flatten[Reverse /@ RunLengthEncode[ # ]] &, {d}, n - 1]; F[n_] := LookAndSay[n, 7][[n]]; Table[FromDigits[F[n]], {n, 1, 11}] (* _Zerinvary Lajos_, Jul 08 2009 *)
%Y Cf. A001155, A005150, A006751, A006715, A001140, A001141, A001143, A001151, A001154.
%K nonn,base,easy,nice
%O 1,1
%A _N. J. A. Sloane_
|
