Triangle read by rows: T(n,k) = number of nonisomorphic connected graphs with n vertices and k edges (n >= 1, n-1 <= k <= n(n-1)/2).

A076263

Triangle read by rows: T(n,k) = number of nonisomorphic connected graphs with n vertices and k edges (n >= 1, n-1 <= k <= n(n-1)/2).

Terms

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

External references