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.

A350426 a(n) is the maximum number of key comparisons required to sort n records with distinct keys using heapsort (Algorithm H in Don Knuth's TAOCP Vol. 3).

Table of values

n a(n)
2 1
3 3
4 7
5 12
6 17
7 22
8 29
9 37
10 44
11 51
12 59
13 66
14 73
15 80

List of values

[1, 3, 7, 12, 17, 22, 29, 37, 44, 51, 59, 66, 73, 80]