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 A036110 #7 Feb 02 2021 15:48:32 %S A036110 2,2,22,32,1332,332211,433231,14533231,1524632231,162524534241, %T A036110 263544336241,363564435231,463554733221,17364544733221,37263554634231, %U A036110 37363554734231,37364544933221,1937263554933221,3927263544835231,391827264534836231,293827363544836231 %N A036110 A summarize Fibonacci sequence: summarize the previous two terms!. %C A036110 From the 26th term the sequence gets into a cycle of 46. %o A036110 (Python) %o A036110 def aupton(nn): %o A036110 alst = [2, 2] %o A036110 for n in range(2, nn+1): %o A036110 prev2, anstr = sorted(str(alst[-2]) + str(alst[-1])), "" %o A036110 for d in sorted(set(prev2), reverse=True): %o A036110 anstr += str(prev2.count(d)) + d %o A036110 alst.append(int(anstr)) %o A036110 return alst %o A036110 print(aupton(20)) # _Michael S. Branicky_, Feb 02 2021 %Y A036110 Cf. A036059, A007890. %K A036110 base,easy,nonn %O A036110 0,1 %A A036110 _Floor van Lamoen_