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 A200311 #13 Sep 23 2016 10:03:14 %S A200311 2,3,4,5,5,6,6,6,7,7,7,7,8,8,8,8,8,8,9,9,9,9,9,9,9,9,10,10,10,10,10, %T A200311 10,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,12, %U A200311 12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13 %N A200311 Number of comparisons needed for optimal merging of 2 elements with n elements. %D A200311 R. L. Graham, On sorting by comparisons, in Proceedings of the ATLAS Symposium, 1971, pp. 263-269; http://www.math.ucsd.edu/~ronspubs/71_07_sorting.pdf. %D A200311 F. K. Hwang and S. Lin, Optimal merging of 2 elements with n elementsw, Acta Informatica, 1 (1971), 145-158. %H A200311 <a href="/index/So#sorting">Index entries for sequences related to sorting</a> %F A200311 Let f(i) = A200310(i). Then for i in the range f(n-1)+1 through f(n), a(i) = n. %p A200311 s:=[2,3]; %p A200311 for n from 4 to 13 do %p A200311 for i from A200310(n-1)+1 to A200310(n) do s:=[op(s),n]; od: %p A200311 od: %Y A200311 Cf. A200310, A239100. %K A200311 nonn %O A200311 1,1 %A A200311 _N. J. A. Sloane_, Nov 15 2011