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 A092334 #12 Aug 02 2014 06:17:47 %S A092334 1,1,2,1,1,2,2,3,1,1,2,1,1,2,2,3,2,2,2,3,3,4,1,1,2,1,1,2,2,3,1,1,2,1, %T A092334 1,2,2,3,2,2,2,3,3,4,2,2,2,3,2,2,2,3,2,2,2,3,3,4,3,3,3,3,4,4,5,1,1,2, %U A092334 1,1,2,2,3,1,1,2,1,1,2,2,3,2,2,2,3,3,4,1,1,2,1,1,2,2,3,1,1,2,1,1,2,2,3,2,2 %N A092334 For S a finite string of numbers, let M(S) denote the maximal number among them. Let a(1)=1. For n>1, a(n) is the greatest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily equal) length and M(y_i)=M(y_j) for all i,j. %C A092334 Here multiplication denotes concatenation of strings. This is Gijswijt's sequence, A090822, except we count 'y' blocks as being equivalent as long as their maximal elements are identical. %H A092334 F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL10/Sloane/sloane55.html">A Slow-Growing Sequence Defined by an Unusual Recurrence</a>, J. Integer Sequences, Vol. 10 (2007), #07.1.2. %H A092334 F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [<a href="http://neilsloane.com/doc/gijs.pdf">pdf</a>, <a href="http://neilsloane.com/doc/gijs.ps">ps</a>]. %H A092334 <a href="/index/Ge#Gijswijt">Index entries for sequences related to Gijswijt's sequence</a> %Y A092334 Cf. A090822, A091975, A091976. %K A092334 nonn %O A092334 1,3 %A A092334 J. Taylor (integersfan(AT)yahoo.com), Mar 17 2004