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

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

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =3a(6) =1a(7) =4a(8) =6a(9) =1a(10) =5a(11) =28a(12) =1a(13) =6a(14) =48a(15) =101a(16) =1a(17) =7a(18) =73a(19) =963a(20) =1a(21) =8a(22) =106a(23) =1818a(24) =10413a(25) =1a(26) =9a(27) =147a(28) =3383a(29) =271128

External references