Triangle read by rows in which row n gives the number of unlabeled bicolored graphs having k nodes of one color and n-k nodes of the other color, with no isolated nodes; the color classes are not interchangeable.

A122083

Triangle read by rows in which row n gives the number of unlabeled bicolored graphs having k nodes of one color and n-k nodes of the other color, with no isolated nodes; the color classes are not interchangeable.

Terms

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

External references