%I #35 Sep 26 2020 15:14:53

%S 1,2,4,11,33,148,906,8887,136756,3269264,115811998,5855499195,

%T 410580177259

%N Number of perfect simple undirected graphs on n nodes.

%D A. Brandstaedt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Publications, 1999.

%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 Florian Kohl, McCabe Olsen, Raman Sanyal, <a href="https://arxiv.org/abs/1906.01469">Unconditional reflexive polytopes</a>, arXiv:1906.01469 [math.CO], 2019. Also Discrete and Computational Geom., 64:2 (2020), 427-452.

%H Brendan McKay, <a href="http://dcsmail.anu.edu.au/pipermail/nauty-list/2002/000031.html">Perfect graphs</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PerfectGraph.html">Perfect Graph</a>

%Y Cf. A052433.

%K nonn,hard,more

%O 1,2

%A _Eric W. Weisstein_

%E McKay link, giving more terms, supplied by _Vladeta Jovovic_, Jan 31 2003

%E a(12) added by _N. J. A. Sloane_ from the Hougardy paper, Oct 17 2006

%E a(13) added by _Brendan McKay_, Mar 11 2018