cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A241843 #30 Feb 16 2025 08:33:22
%S A241843 0,0,0,1,6,54,581,9503,249169,11607032,1005452874,164042264045,
%T A241843 50335602558672,29003480904157108
%N A241843 Number of simple connected graphs on n nodes that are non-chordal.
%H A241843 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A241843 Travis Hoppe and Anna Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H A241843 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ChordalGraph.html">Chordal Graph</a>
%F A241843 a(n) = A001349(n) - A048192(n).
%F A241843 a(n) = A287481(n) - A287482(n). - _Eric W. Weisstein_, May 26 2017
%Y A241843 Cf. A001349, A048192.
%Y A241843 Cf. A287481 (not-necessarily connected simple non-chordal graphs).
%Y A241843 Cf. A287482 (disconnected simple non-chordal graphs).
%K A241843 nonn,less,more
%O A241843 1,5
%A A241843 _Travis Hoppe_ and _Anna Petrone_, Apr 29 2014
%E A241843 a(13) and a(14) from formula by _Falk Hüffner_, Jan 15 2016