login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241843 Number of simple connected graphs on n nodes that are non-chordal. 2
0, 0, 0, 1, 6, 54, 581, 9503, 249169, 11607032, 1005452874, 164042264045, 50335602558672, 29003480904157108 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014
Eric Weisstein's World of Mathematics, Chordal Graph
FORMULA
a(n) = A001349(n) - A048192(n).
a(n) = A287481(n) - A287482(n). - Eric W. Weisstein, May 26 2017
CROSSREFS
Cf. A287481 (not-necessarily connected simple non-chordal graphs).
Cf. A287482 (disconnected simple non-chordal graphs).
Sequence in context: A109576 A365843 A366014 * A201352 A186375 A231554
KEYWORD
nonn,less
AUTHOR
Travis Hoppe and Anna Petrone, Apr 29 2014
EXTENSIONS
a(13) and a(14) from formula by Falk Hüffner, Jan 15 2016
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)