Triangle read by rows: T(n,k) is the number of labeled simple graphs with n edges and k vertices and without endpoints or isolated vertices.

A369931

Triangle read by rows: T(n,k) is the number of labeled simple graphs with n edges and k vertices and without endpoints or isolated vertices.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =0a(9) =3a(10) =0a(11) =0a(12) =0a(13) =6a(14) =12a(15) =0a(16) =0a(17) =0a(18) =1a(19) =85a(20) =70a(21) =0a(22) =0a(23) =0a(24) =0a(25) =100a(26) =990a(27) =465a(28) =0a(29) =0

External references