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).

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).

Terms

    a(0) =1a(1) =9a(2) =78a(3) =657a(4) =5448a(5) =49869a(6) =520416a(7) =5901138a(8) =70092000a(9) =902850273a(10) =12416814432a(11) =183763314090

External references