11557799

Appears in sequences

• Number of simple perfect matching graphs on 2n nodes.at n=4A218462
• 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)).at n=35A286951