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.

A350569 a(n)/n! is the average 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 2
3 18
4 154
5 1257
6 10152
7 91557
8 922368
9 10286658
10 119281680
11 1517655690
12 20619929376
13 303487939485
14 4662169420608

List of values

[2, 18, 154, 1257, 10152, 91557, 922368, 10286658, 119281680, 1517655690, 20619929376, 303487939485, 4662169420608]