A117627 - cp's OEIS frontend

A117627 Let f(n) = minimum of average number of comparisons needed for any sorting method for n elements and let g(n) = n!*f(n). Sequence gives a lower bound on g(n).

n	a(n)
1	0
2	2
3	16
4	112
5	832
6	6896
7	62368
8	619904
9	6733312
10	79268096
11	1010644736
12	13833177088
13	203128772608
14	3175336112128
15	52723300200448
16	927263962759168
17	17221421451378688
18	336720980854571008
19	6911300635636400128
20	148661140496700932096

[0, 2, 16, 112, 832, 6896, 62368, 619904, 6733312, 79268096, 1010644736, 13833177088, 203128772608, 3175336112128, 52723300200448, 927263962759168, 17221421451378688, 336720980854571008, 6911300635636400128, 148661140496700932096]

cp's OEIS Frontend

A117627 Let f(n) = minimum of average number of comparisons needed for any sorting method for n elements and let g(n) = n!*f(n). Sequence gives a lower bound on g(n).

Table of values

List of values