|
%I #11 Aug 13 2017 12:56:49
%S 0,1,2,5,13,43,186,1187,13006,270900,11286208
%N Number of simple disconnected weakly perfect graphs on n vertices.
%C First differs from A287008 (number of simple disconnected graphs with equal chromatic and fractional chromatic number) at a(8).
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DisconnectedGraph.html">Disconnected Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WeaklyPerfectGraph.html">Weakly Perfect Graph</a>
%F a(n) = A198634(n) - A287009(n).
%Y Cf. A198634 (number of not necessarily connected simple weakly perfect graphs).
%Y Cf. A287009 (number of not connected simple weakly perfect graphs).
%Y Cf. A287008 (number of simple disconnected graphs with equal chromatic and fractional chromatic number).
%K nonn,more
%O 1,3
%A _Eric W. Weisstein_, May 18 2017
%E a(11) from formula by _Falk Hüffner_, Aug 13 2017
| 