The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241843 Number of simple connected graphs on n nodes that are non-chordal. 2

%I

%S 0,0,0,1,6,54,581,9503,249169,11607032,1005452874,164042264045,

%T 50335602558672,29003480904157108

%N Number of simple connected graphs on n nodes that are non-chordal.

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014

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

%F a(n) = A001349(n) - A048192(n).

%F a(n) = A287481(n) - A287482(n). - _Eric W. Weisstein_, May 26 2017

%Y Cf. A287481 (not-necessarily connected simple non-chordal graphs).

%Y Cf. A287482 (disconnected simple non-chordal graphs).

%K nonn,less

%O 1,5

%A _Travis Hoppe_ and _Anna Petrone_, Apr 29 2014

%E a(13) and a(14) from formula by _Falk Hüffner_, Jan 15 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 6 16:03 EDT 2020. Contains 336255 sequences. (Running on oeis4.)