Triangle read by rows: T(n,k) = number of edge-rooted unlabeled graphs having n nodes and k edges, n > 0, 0 < k <= n*(n-1)/2.

A126123

Triangle read by rows: T(n,k) = number of edge-rooted unlabeled graphs having n nodes and k edges, n > 0, 0 < k <= n*(n-1)/2.

Terms

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

External references