Number of bicolored graphs on n unlabeled nodes such that black nodes are not adjacent to each other and every white node is adjacent to a black node.

A340021

Number of bicolored graphs on n unlabeled nodes such that black nodes are not adjacent to each other and every white node is adjacent to a black node.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =5a(4) =16a(5) =66a(6) =407a(7) =3948a(8) =66781a(9) =2057140a(10) =117820559a(11) =12562407832

External references