Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs.

A144161

Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs.

Terms

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

External references