Triangle read by rows: T(n,k) = number of n-node graphs with k nodes in distinguished bipartite block, k = 0..n.
A028657
Triangle read by rows: T(n,k) = number of n-node graphs with k nodes in distinguished bipartite block, k = 0..n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =3a(8) =3a(9) =1a(10) =1a(11) =4a(12) =7a(13) =4a(14) =1a(15) =1a(16) =5a(17) =13a(18) =13a(19) =5a(20) =1a(21) =1a(22) =6a(23) =22a(24) =36a(25) =22a(26) =6a(27) =1a(28) =1a(29) =7
External references
- oeis: A028657