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 #12 Aug 10 2017 17:01:40
%S 0,0,0,0,1,8,70,724,10975,271378,12152603,1029799448,166102803505,
%T 50667847301581
%N Number of disconnected simple non-chordal graphs on n vertices.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ChordalGraph.html">Chordal Graph</a>
%F a(n) = A287481(n) - A241843(n).
%Y Cf. A287481 (not-necessarily connected non-chordal graphs).
%Y Cf. A241843 (connected non-chordal graphs).
%K nonn,more
%O 1,6
%A _Eric W. Weisstein_, May 25 2017
%E a(11)-a(14) using formula by _Falk Hüffner_, Aug 10 2017