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.

A350660 a(n) is the average number of key comparisons, rounded to the nearest integer, required to sort n records with distinct keys using bubble sort (Algorithm B in Don Knuth's TAOCP Vol. 3).

Table of values

n a(n)
2 1
3 3
4 5
5 9
6 13
7 18
8 24
9 31
10 39
11 48
12 58
13 69
14 80
15 93
16 107
17 121
18 137
19 153
20 171
21 189
22 209
23 229
24 251
25 273
26 297
27 321
28 346
29 373
30 400
31 428
32 458
33 488
34 519
35 551
36 584
37 619
38 654
39 690
40 727
41 765
42 804
43 845
44 886
45 928
46 971
47 1015
48 1060
49 1106
50 1153
51 1201
52 1250
53 1300
54 1351
55 1403

List of values

[1, 3, 5, 9, 13, 18, 24, 31, 39, 48, 58, 69, 80, 93, 107, 121, 137, 153, 171, 189, 209, 229, 251, 273, 297, 321, 346, 373, 400, 428, 458, 488, 519, 551, 584, 619, 654, 690, 727, 765, 804, 845, 886, 928, 971, 1015, 1060, 1106, 1153, 1201, 1250, 1300, 1351, 1403]