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.

A287481 Number of (not-necessarily connected) non-chordal simple graphs on n vertices.

This page as a plain text file.
%I A287481 #15 Feb 16 2025 08:33:46
%S A287481 0,0,0,1,7,62,651,10227,260144,11878410,1017605477,165072063493,
%T A287481 50501705362177,29054148751458689
%N A287481 Number of (not-necessarily connected) non-chordal simple graphs on n vertices.
%H A287481 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ChordalGraph.html">Chordal Graph</a>
%F A287481 a(n) = A241843(n) + A287482(n).
%F A287481 a(n) = A000088(n) - A048193(n).
%Y A287481 Cf. A241843 (simple connected non-chordal graphs).
%Y A287481 Cf. A287482 (simple disconnected non-chordal graphs).
%K A287481 nonn,more
%O A287481 1,5
%A A287481 _Eric W. Weisstein_, May 25 2017
%E A287481 a(11)-a(14) using formula by _Falk Hüffner_, Aug 10 2017