Triangle read by rows: T(n,k) = number of unlabeled bicolored graphs with no isolated nodes having 2n nodes and k edges, with n nodes of each color. Here n >= 0, 0 <= k <= n^2.
A123547
Triangle read by rows: T(n,k) = number of unlabeled bicolored graphs with no isolated nodes having 2n nodes and k edges, with n nodes of each color. Here n >= 0, 0 <= k <= n^2.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =1a(6) =1a(7) =1a(8) =0a(9) =0a(10) =0a(11) =1a(12) =2a(13) =4a(14) =3a(15) =2a(16) =1a(17) =1a(18) =0a(19) =0a(20) =0a(21) =0a(22) =1a(23) =2a(24) =8a(25) =14a(26) =21a(27) =20a(28) =20a(29) =12
External references
- oeis: A123547