|
%I M4768 #31 Sep 18 2022 12:10:54
%S 1,11,12,1121,122111,112213,12221131,1123123111,12213111213113,
%T 11221131132111311231,12221231123121133112213111,
%U 1123112131122131112112321222113113,1221311221113112221131132112213121112312311231
%N Describe the previous term! (method B - initial term is 1).
%C Method B = 'digit'-indication followed by 'frequency'.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Reinhard Zumkeller, <a href="/A007651/b007651.txt">Table of n, a(n) for n = 1..25</a>
%F a(n) = Sum_{k=1..A005341(n)} A220424(n,k)*10^(A005341(n)-k). - _Reinhard Zumkeller_, Dec 15 2012
%e The term after 1121 is obtained by saying "1 twice, 2 once, 1 once", which gives 122111.
%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, 1 ][ [ n ] ]; Table[ FromDigits[ Reverse[ F[ n ] ] ], {n, 1, 15} ]
%t a[1] = 1; a[n_] := a[n] = FromDigits[Flatten[{First[#], Length[#]}&/@Split[IntegerDigits[a[n-1]]]]]; Map[a, Range[25]] (* _Peter J. C. Moses_, Mar 22 2013 *)
%o (Haskell)
%o a007651 = foldl1 (\v d -> 10 * v + d) . map toInteger . a220424_row
%o -- _Reinhard Zumkeller_, Dec 15 2012
%o (Python)
%o from itertools import accumulate, groupby, repeat
%o def summarize(n, _): return int("".join(k+str(len(list(g))) for k, g in groupby(str(n))))
%o def aupto(terms): return list(accumulate(repeat(1, terms), summarize))
%o print(aupto(13)) # _Michael S. Branicky_, Sep 18 2022
%Y Cf. A005150, A022470, A022499, A022500-A022505.
%K nonn,base,easy,nice
%O 1,2
%A _N. J. A. Sloane_
|
