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 A092333 #11 Aug 02 2014 06:17:47 %S A092333 1,1,2,2,3,2,3,3,4,3,4,4,5,4,5,4,5,5,6,5,6,6,7,5,6,6,7,7,8,7,8,6,7,7, %T A092333 8,8,9,8,9,8,9,9,10,9,10,8,9,9,10,10,11,9,10,10,11,11,12,10,11,11,12, %U A092333 12,13,11,12,12,13,13,14,10,11,11,12,12,13,11,12,12,13,13,14,13,14,13,14 %N A092333 For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest 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 for any i<k, F(y_i)>=F(y_(i+1)). %C A092333 Here multiplication denotes concatenation of strings. This is Gijswijt's sequence, A090822, except we accept 'y' blocks as upholding Gijswijt's axiom whenever they satisfy the inequality above. %C A092333 Question: Is there any integer U such that a(M)<=a(M+1) for all M>U? %H A092333 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 A092333 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 A092333 <a href="/index/Ge#Gijswijt">Index entries for sequences related to Gijswijt's sequence</a> %Y A092333 Cf. A090822, A091975, A091976. %K A092333 nonn %O A092333 1,3 %A A092333 J. Taylor (integersfan(AT)yahoo.com), Mar 17 2004