A036106 - OEIS

%I #12 Nov 02 2016 03:33:46

%S 1,2,1211,2231,133241,14333231,24632241,1634534231,261544434231,

%T 262564533241,363564435231,464544634221,463574533221,17363574434221,

%U 37263554634231,37363554734231,37364544933221,1937263554933221

%N A summarize Fibonacci sequence: summarize the previous two terms!.

%C From the 26th term the sequence gets into a cycle of 46.

%H Reinhard Zumkeller, <a href="/A036106/b036106.txt">Table of n, a(n) for n = 0..254</a> = 5 periods.

%H <a href="/index/Sa#swys">Index to sequences related to say what you see</a>

%e a(24) = 293847463554538221;

%e a(25) = 294827365564537221 = first term of first period;

%e a(26) = 293837366554537221;

%e a(70) = 294837364554538221 = last term of first period != a(24);

%e a(71) = 294827365564537221 = a(25) = first term of second period;

%e a(72) = 293837366554537221 = a(26);

%e a(116) = 294837364554538221 = a(70) = last term of second period;

%e a(117) = 294827365564537221 = a(71) = first term of third period.

%t a[0] = 1; a[1] = 2; a[n_] := a[n] = Reverse /@ (IntegerDigits /@ {a[n-2], a[n-1]} // Flatten // Tally // Sort // Reverse) // Flatten // FromDigits; Table[a[n], {n, 0, 17}] (* _Jean-François Alcover_, Nov 02 2016 *)

%o (Haskell)

%o import Data.List (sort, group); import Data.Function (on)

%o a036106 n = a036106_list !! n

%o a036106_list = 1 : 2 : map (read . concatMap say . reverse . group . sort)

%o                (zipWith ((++) `on` show) a036106_list $ tail a036106_list)

%o                where say ws = (show $ length ws) ++ [head ws]

%o -- _Reinhard Zumkeller_, Oct 05 2015

%Y Cf. A036059.

%K base,easy,nice,nonn

%O 0,2

%A _Floor van Lamoen_