Triangle read by rows: T(n,k)=number of simple graphs on n labeled nodes with k edges containing at least one cycle subgraph, n>=3, 3<=k<=C(n,2).

A143899

Triangle read by rows: T(n,k)=number of simple graphs on n labeled nodes with k edges containing at least one cycle subgraph, n>=3, 3<=k<=C(n,2).

Terms

    a(0) =1a(1) =4a(2) =15a(3) =6a(4) =1a(5) =10a(6) =85a(7) =252a(8) =210a(9) =120a(10) =45a(11) =10a(12) =1a(13) =20a(14) =285a(15) =1707a(16) =5005a(17) =6435a(18) =6435a(19) =5005a(20) =3003a(21) =1365a(22) =455a(23) =105a(24) =15a(25) =1a(26) =35a(27) =735a(28) =6972a(29) =37457

External references