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 A215476 #37 Apr 09 2023 15:31:35 %S A215476 0,1,3,4,6,8,10,12,14,16,18,20,23 %N A215476 Minimum number of comparisons needed to find the median of n elements. %C A215476 Dor and Zwick 1999 prove a(n) <= 2.95n + o(n). %C A215476 Dor and Zwick 2001 prove a(n) >= (2+2^(-80))n - o(n). %D A215476 D. Dor and U. Zwick, Median selection requires (2+epsilon)n comparisons, SIAM J. Discrete Math 14(3):312-325, 2001. %D A215476 D. Dor and U. Zwick, Selecting the median, SIAM J. Comput. 28(5):1722-1758, 1999. %D A215476 D. E. Knuth, The Art of Computer Programming, Vol. 3, 2nd edition, Sect. 5.3.2. %D A215476 Kenneth Oksanen, Searching for selection algorithms, Elec. Notes Discrete Math. 27:77, 2006. %H A215476 William Gasarch, Wayne Kelly and William Pugh, <a href="https://doi.org/10.1145/235767.235772">Finding the i-th largest of n for small i,n</a>, ACM SIGACT News, Volume 27, Issue 2, June 1996, pp. 88-96. %H A215476 Kenneth Oksanen, <a href="http://www.cs.hut.fi/~cessu/selection/">Selecting the i'th largest of n elements</a>. (last modified April 2005) %F A215476 a(n) = A360495(n,ceiling(n/2)). - _Paolo Xausa_, Apr 09 2023 %Y A215476 Cf. A117627, A360495. %K A215476 nonn,hard,more %O A215476 1,3 %A A215476 _Jeff Erickson_, Aug 12 2012 %E A215476 Added three more terms (from Kenneth Oksanen), _Jeff Erickson_, Aug 13 2012