Number of minimum edge covers of the complete graph K_n.

Terms

a(0) =0a(1) =1a(2) =3a(3) =3a(4) =30a(5) =15a(6) =315a(7) =105a(8) =3780a(9) =945a(10) =51975a(11) =10395a(12) =810810a(13) =135135a(14) =14189175a(15) =2027025a(16) =275675400a(17) =34459425a(18) =5892561675a(19) =654729075a(20) =137493105750a(21) =13749310575a(23) =316234143225