Irregular triangular array read by rows: T(n,k) is the number of 2-colored simple labeled graphs on n nodes that have exactly k edges, 0<=k<=A002620(n), n>=1.

A241669

Irregular triangular array read by rows: T(n,k) is the number of 2-colored simple labeled graphs on n nodes that have exactly k edges, 0<=k<=A002620(n), n>=1.

Terms

    a(0) =0a(1) =2a(2) =2a(3) =6a(4) =12a(5) =6a(6) =14a(7) =48a(8) =60a(9) =32a(10) =6a(11) =30a(12) =160a(13) =360a(14) =440a(15) =310a(16) =120a(17) =20a(18) =62a(19) =480a(20) =1680a(21) =3480a(22) =4680a(23) =4212a(24) =2520a(25) =960a(26) =210a(27) =20a(28) =126a(29) =1344

External references