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 A288971 #23 Feb 05 2018 10:29:56 %S A288971 0,0,2,16,112,848,7008,63648,635040,6915168,81757440,1044161280, %T A288971 14334076800,210595524480 %N A288971 Number of key comparisons to sort all n! permutations of n elements by the optimal quadral-pivot quicksort. %C A288971 The 4 pivot elements are chosen from fixed indices (e.g. the last 4 elements). The "optimal" strategy minimizes, after the choice of the pivots is done, the expected partitioning cost. %H A288971 M. Aumüller and M. Dietzfelbinger, <a href="https://doi.org/10.1145/2963102">How Good Is Multi-Pivot Quicksort?</a>, ACM Transactions on Algorithms (TALG), Volume 13 Issue 1, 2016. %H A288971 M. Aumüller and M. Dietzfelbinger, <a href="https://arxiv.org/abs/1510.04676">How Good Is Multi-Pivot Quicksort?</a>, arXiv:1510.04676 [cs.DS], 2016. %H A288971 Daniel Krenn, <a href="https://github.com/dkrenn/quickstar">Quickstar</a>, Program in SageMath, on GitHub. %H A288971 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>. %Y A288971 Cf. A288964, A288965, A288970. %K A288971 nonn,more %O A288971 0,3 %A A288971 _Daniel Krenn_, Jun 20 2017 %E A288971 a(9)-a(13) from _Melanie Siebenhofer_, Feb 05 2018