11546911

Appears in sequences

• Number of simple connected perfect matching graphs on 2n nodes.at n=4A218463
• Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with matching number k, (0 <= k <= floor(n/2)).at n=35A325304