A218463
Number of simple connected perfect matching graphs on 2n nodes.
Original entry on oeis.org
1, 5, 95, 10297, 11546911
Offset: 1
Cf.
A218462 (not-necessarily-connected simple perfect matching graphs).
Cf.
A287652 (disconnected simple perfect matching graphs).
A286951
Irregular triangle read by rows: T(n,k) is the number of simple graphs with n vertices with matching number k (0 <= k <= floor(n/2)).
Original entry on oeis.org
1, 1, 1, 1, 1, 3, 1, 4, 6, 1, 5, 28, 1, 6, 48, 101, 1, 7, 73, 963, 1, 8, 106, 1818, 10413, 1, 9, 147, 3383, 271128, 1, 10, 198, 6129, 441031, 11557799
Offset: 0
Triangle begins:
1;
1;
1, 1;
1, 3;
1, 4, 6;
1, 5, 28;
1, 6, 48, 101;
1, 7, 73, 963;
1, 8, 106, 1818, 10413;
...
A287652
Number of simple disconnected perfect matching graphs on 2n nodes.
Original entry on oeis.org
0, 1, 6, 116, 10888
Offset: 1
Cf.
A218462 (simple not-necessarily connected perfect matching graphs).
Cf.
A218463 (connected perfect matching graphs).
Showing 1-3 of 3 results.
Comments