Number of bicolored graphs on n unlabeled nodes such that every white node is adjacent to a black node.

A339836

Number of bicolored graphs on n unlabeled nodes such that every white node is adjacent to a black node.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =10a(4) =47a(5) =296a(6) =2970a(7) =49604a(8) =1484277a(9) =81494452a(10) =8273126920

External references