Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n).

A228890

Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n).

Terms

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

External references