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 A098154 #3 Mar 30 2012 17:36:43 %S A098154 1,11,21,1112,10112,1010112,2011112,1011122,1011122,1011122,1011122, %T A098154 1011122,1011122,1011122,1011122,1011122,1011122,1011122,1011122, %U A098154 1011122,1011122,1011122,1011122,1011122,1011122,1011122,1011122 %N A098154 Summarize the previous term in ternary (in increasing order). %C A098154 Similar to A005151 but uses base 3: Let a(1)=1. Describing a(1) as "one 1" again gives a(2)=11 (same digit string as A005151 and similar sequences). Likewise, a(3) and a(4) have same digit strings as all but the binary sequence, but describing a(4) as "three 1's, one 2" gives a(5)=10112 when the frequency of digit occurrence is written in ternary and followed by the digit counted. %F A098154 a(n) = 1011122 for all n >= 8 (see example). %e A098154 Summarizing a(8) = 1011122 in increasing digit order, there are "one 0, four 1's, two 2s", so concatenating 1 0 11 1 2 2 gives a(9) = 1011122 (=a(10)=a(11)=...). %Y A098154 Cf. A098153 (binary), A098155 (base 4), A005151 (decimal and digit strings for all other bases b >= 5). %K A098154 base,easy,nonn %O A098154 1,2 %A A098154 _Rick L. Shepherd_, Aug 29 2004