Number of bicolored graphs on n unlabeled nodes such that black nodes are not adjacent to each other.

A339832

Number of bicolored graphs on n unlabeled nodes such that black nodes are not adjacent to each other.

Terms

    a(0) =1a(1) =2a(2) =5a(3) =14a(4) =50a(5) =230a(6) =1543a(7) =16252a(8) =294007a(9) =9598984a(10) =577914329a(11) =64384617634

External references