Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Feb 12 2021 11:47:42
%S 1,0,2,3,8,54,380,3462,83606,4822240
%N Number of unlabeled graphs on n vertices whose independence number is equal to clique number.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CliqueNumber.html">Clique number</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependenceNumber.html">Independence Number</a>.
%e a(3) = 2 because, of the four graphs of order three, only the path graph and its complement have equal independence and clique number, 2 in this case.
%K nonn,more
%O 1,3
%A _Freddy Barrera_, Jan 09 2021