|
%I #16 Aug 10 2017 09:28:13
%S 0,0,1,3,15,88,680,7623,126047,3118189,112367111,5736020864
%N Number of simple connected perfect non-bipartite graphs on n vertices.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BipartiteGraph.html">Bipartite Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ConnectedGraph.html">Connected Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PerfectGraph.html">Perfect Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SimpleGraph.html">Simple Graph</a>
%F a(n) = A052433(n) - A005142(n), since all bipartite graphs are perfect. - _Falk Hüffner_, Aug 10 2017
%Y Cf. A005142, A052433.
%K nonn,more
%O 1,4
%A _Eric W. Weisstein_, May 26 2017
%E a(11)-a(12) from formula by _Falk Hüffner_, Aug 10 2017
|
