Triangle read by rows: T(n,k) = number of connected n-node graphs with k nodes in distinguished bipartite block, k = 0..n.

A363845

Triangle read by rows: T(n,k) = number of connected n-node graphs with k nodes in distinguished bipartite block, k = 0..n.

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) =1a(12) =2a(13) =1a(14) =0a(15) =0a(16) =1a(17) =4a(18) =4a(19) =1a(20) =0a(21) =0a(22) =1a(23) =6a(24) =13a(25) =6a(26) =1a(27) =0a(28) =0a(29) =1

External references