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)).

A325304

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)).

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =2a(6) =0a(7) =1a(8) =5a(9) =0a(10) =1a(11) =20a(12) =0a(13) =1a(14) =16a(15) =95a(16) =0a(17) =1a(18) =22a(19) =830a(20) =0a(21) =1a(22) =29a(23) =790a(24) =10297a(25) =0a(26) =1a(27) =37a(28) =1479a(29) =259563

External references