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.

A350428 2*a(n)/n! is the average 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 9
4 78
5 657
6 5448
7 49869
8 520416
9 5901138
10 70092000
11 902850273
12 12416814432
13 183763314090
14 2854581512832

List of values

[1, 9, 78, 657, 5448, 49869, 520416, 5901138, 70092000, 902850273, 12416814432, 183763314090, 2854581512832]