Number of clique-separable perfect graphs on n nodes.
A123414
Number of clique-separable perfect graphs on n nodes.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =11a(4) =32a(5) =129a(6) =630a(7) =4118a(8) =34375a(9) =364004
External references
- oeis: A123414
A123414
Number of clique-separable perfect graphs on n nodes.