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

A054924

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

Terms

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

External references