cp's OEIS Frontend

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.

A360495 Triangle read by rows: T(n,k) is the minimum number of pairwise comparisons needed (in the worst case) to determine the k-th largest of n distinct numbers, for 1 <= k <= n.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 3
6 2
7 3
8 4
9 4
10 3
11 4
12 6
13 6
14 6
15 4
16 5
17 7
18 8
19 8
20 7
21 5
22 6
23 8
24 10
25 10
26 10
27 8
28 6
29 7
30 9
31 11
32 12
33 12
34 11
35 9
36 7
37 8
38 11
39 12
40 14
41 14
42 14
43 12
44 11
45 8
46 9
47 12
48 14
49 15
50 16
51 16
52 15
53 14
54 12
55 9
56 10
57 13
58 15
59 17
60 18
61 18
62 18
63 17
64 15
65 13
66 10
67 11
68 14
69 17
70 18
71 19
72 20
73 20
74 19
75 18
76 17
77 14
78 11

List of values

[0, 1, 1, 2, 3, 2, 3, 4, 4, 3, 4, 6, 6, 6, 4, 5, 7, 8, 8, 7, 5, 6, 8, 10, 10, 10, 8, 6, 7, 9, 11, 12, 12, 11, 9, 7, 8, 11, 12, 14, 14, 14, 12, 11, 8, 9, 12, 14, 15, 16, 16, 15, 14, 12, 9, 10, 13, 15, 17, 18, 18, 18, 17, 15, 13, 10, 11, 14, 17, 18, 19, 20, 20, 19, 18, 17, 14, 11]