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 #10 Aug 20 2017 11:53:16
%S 1,2,4,11,33,147,896,8682,131303,3063185
%N Number of strongly perfect perfect graphs on n nodes.
%H S. Hougardy, <a href="http://www.or.uni-bonn.de/~hougardy/">Home Page</a>
%H S. Hougardy, <a href="http://dx.doi.org/10.1016/j.disc.2006.05.021">Classes of perfect graphs</a>, Discr. Math. 306 (2006), 2529-2571.
%H Lawrence Ong, <a href="https://arxiv.org/abs/1606.05982">Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers</a>, arXiv preprint arXiv:1606.05982 [cs.IT], 2016.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Oct 18 2006