Irregular triangle read by rows: T(n,k) is the number of unlabeled connected n-node graphs with intersection number (or edge clique cover number) k; n >= 1, 0 <= k <= floor(n^2/4).

A355755

Irregular triangle read by rows: T(n,k) is the number of unlabeled connected n-node graphs with intersection number (or edge clique cover number) k; n >= 1, 0 <= k <= floor(n^2/4).

Terms

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

External references