Triangle read by rows: row n gives number of matchings of size 0<=k<=n (edges) in the complete graph on 2*n >= 2 vertices.
A119743
Triangle read by rows: row n gives number of matchings of size 0<=k<=n (edges) in the complete graph on 2*n >= 2 vertices.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =6a(4) =3a(5) =1a(6) =15a(7) =45a(8) =15a(9) =1a(10) =28a(11) =210a(12) =420a(13) =105a(14) =1a(15) =45a(16) =630a(17) =3150a(18) =4725a(19) =945a(20) =1a(21) =66a(22) =1485a(23) =13860a(24) =51975a(25) =62370a(26) =10395a(27) =1a(28) =91a(29) =3003
External references
- oeis: A119743