A067699 - cp's OEIS frontend

A067699 Number of comparisons made in a version of the sorting algorithm QuickSort for an array of size n with n identical elements.

n	a(n)
1	0
2	4
3	8
4	14
5	18
6	24
7	30
8	38
9	42
10	48
11	54
12	62
13	68
14	76
15	84
16	94
17	98
18	104
19	110
20	118
21	124
22	132
23	140
24	150
25	156
26	164
27	172
28	182
29	190
30	200
31	210
32	222
33	226
34	232
35	238
36	246
37	252
38	260
39	268
40	278
41	284
42	292
43	300
44	310
45	318
46	328
47	338
48	350
49	356
50	364
51	372
52	382

[0, 4, 8, 14, 18, 24, 30, 38, 42, 48, 54, 62, 68, 76, 84, 94, 98, 104, 110, 118, 124, 132, 140, 150, 156, 164, 172, 182, 190, 200, 210, 222, 226, 232, 238, 246, 252, 260, 268, 278, 284, 292, 300, 310, 318, 328, 338, 350, 356, 364, 372, 382]

cp's OEIS Frontend

A067699 Number of comparisons made in a version of the sorting algorithm QuickSort for an array of size n with n identical elements.

Table of values

List of values

n	a(n)
1	0
2	4
3	8
4	14
5	18
6	24
7	30
8	38
9	42
10	48
11	54
12	62
13	68
14	76
15	84
16	94
17	98
18	104
19	110
20	118
21	124
22	132
23	140
24	150
25	156
26	164
27	172
28	182
29	190
30	200
31	210
32	222
33	226
34	232
35	238
36	246
37	252
38	260
39	268
40	278
41	284
42	292
43	300
44	310
45	318
46	328
47	338
48	350
49	356
50	364
51	372
52	382

n	a(n)
1	0
2	4
3	8
4	14
5	18
6	24
7	30
8	38
9	42
10	48
11	54
12	62
13	68
14	76
15	84
16	94
17	98
18	104
19	110
20	118
21	124
22	132
23	140
24	150
25	156
26	164
27	172
28	182
29	190
30	200
31	210
32	222
33	226
34	232
35	238
36	246
37	252
38	260
39	268
40	278
41	284
42	292
43	300
44	310
45	318
46	328
47	338
48	350
49	356
50	364
51	372
52	382

n	a(n)
1	0
2	4
3	8
4	14
5	18
6	24
7	30
8	38
9	42
10	48
11	54
12	62
13	68
14	76
15	84
16	94
17	98
18	104
19	110
20	118
21	124
22	132
23	140
24	150
25	156
26	164
27	172
28	182
29	190
30	200
31	210
32	222
33	226
34	232
35	238
36	246
37	252
38	260
39	268
40	278
41	284
42	292
43	300
44	310
45	318
46	328
47	338
48	350
49	356
50	364
51	372
52	382