Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).

A058878

Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).

Terms

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

External references