Triangle read by rows: T(n,k) is the number of edge covers of the complete labeled graph on n nodes that are minimal and have exactly k edges, n>=2, 1<=k<=n-1.
A281269
Triangle read by rows: T(n,k) is the number of edge covers of the complete labeled graph on n nodes that are minimal and have exactly k edges, n>=2, 1<=k<=n-1.
Terms
- a(0) =1a(1) =0a(2) =3a(3) =0a(4) =3a(5) =4a(6) =0a(7) =0a(8) =30a(9) =5a(10) =0a(11) =0a(12) =15a(13) =150a(14) =6a(15) =0a(16) =0a(17) =0a(18) =315a(19) =525a(20) =7a(21) =0a(22) =0a(23) =0a(24) =105a(25) =3360a(26) =1568a(27) =8a(28) =0a(29) =0
External references
- oeis: A281269