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 A288970 #45 Feb 03 2018 12:54:11 %S A288970 0,0,2,16,112,848,7032,64056,639888,6974928,82531296,1054724256, %T A288970 14487894144,212971227264 %N A288970 Number of key comparisons to sort all n! permutations of n elements by the optimal trial-pivot quicksort. %C A288970 The 3 pivot elements are chosen from fixed indices (e.g., the last 3 elements). The "optimal" strategy minimizes, after the choice of the pivots is done, the expected partitioning cost. %H A288970 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 A288970 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 A288970 Daniel Krenn, <a href="https://github.com/dkrenn/quickstar">Quickstar</a>, Program in SageMath, on GitHub. %H A288970 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>. %Y A288970 Cf. A001768, A003070, A036604, A117627, A117628, A159324, A288964, A288965, A288971. %K A288970 nonn,more %O A288970 0,3 %A A288970 _Daniel Krenn_, Jun 20 2017 %E A288970 a(9)-a(11) from _Melanie Siebenhofer_, Jan 29 2018 %E A288970 a(12)-a(13) from _Melanie Siebenhofer_, Feb 02 2018