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.

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

Table of values

n a(n)
2 1
3 3
4 7
5 12
6 16
7 20
8 27
9 34
10 39
11 44
12 51
13 57
14 63

List of values

[1, 3, 7, 12, 16, 20, 27, 34, 39, 44, 51, 57, 63]