a(n)/n! is the average number of key comparisons required to perform an indirect sort of n records with distinct keys using a two-way merge (A. D. Woodall's mergesort).

A350568

a(n)/n! is the average number of key comparisons required to perform an indirect sort of n records with distinct keys using a two-way merge (A. D. Woodall's mergesort).

Terms

    a(0) =2a(1) =19a(2) =130a(3) =992a(4) =8145a(5) =73665a(6) =725630a(7) =7840280a(8) =92297011a(9) =1176802235a(10) =16129154724a(11) =236335661166

External references