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 A350567 #9 Jan 12 2022 14:33:50 %S A350567 1,4,6,10,13,17,20,25,29,34,38,43,47,52 %N A350567 a(n) is the maximum number of key comparisons required to perform an indirect sort of n records with distinct keys using a two-way merge (A. D. Woodall's mergesort). %C A350567 There are six places in the Algol 60 procedure mergesort where the keys are compared. The sequence shows the maxima of the counts of these comparisons, determined over all n! possible orders of the records. %C A350567 a(16) >= 56. %D A350567 D. E. Knuth, The Art of Computer Programming Second Edition. Vol. 3, Sorting and Searching. Chapter 5.2.4 Sorting by Merging, Pages 164-166. Addison-Wesley, Reading, MA, 1998. %H A350567 A. D. Woodall, <a href="https://doi.org/10.1093/comjnl/13.1.110">An internal sorting procedure using a two-way merge</a>, Algorithm 45, The Computer Journal, Volume 13, Number 1, February 1970, Algorithms Supplement, pp. 110-111. %Y A350567 A350568 provides the corresponding average numbers and a comparison table. %Y A350567 Cf. A001768, A001855, A350569. %K A350567 nonn,more %O A350567 2,2 %A A350567 _Hugo Pfoertner_, Jan 09 2022