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.
%I A385929 #24 Jul 28 2025 08:59:28 %S A385929 0,0,0,0,1,0,0,1,9,142 %N A385929 Number of simple, undirected, prime graphs G on n unlabeled vertices with no degree-1 vertex in G or its complement, as well as having no induced P5 in G or in its complement. %C A385929 Here, "prime" means with respect to modular decomposition (see link). A P5 is a path on 5 vertices. %H A385929 The House of Graphs, <a href="https://houseofgraphs.org/graphs/33471">4-sun graph</a> %H A385929 Wikipedia, <a href="https://en.wikipedia.org/wiki/Modular_decomposition">Modular decomposition</a>. %e A385929 The only such graph on n=5 is the C5. The only such graph on n=8 is the split graph called the 4-sun (see the House of Graphs link). %Y A385929 Cf. A079473, A385693, A385697. %K A385929 nonn,more %O A385929 1,9 %A A385929 _Jim Nastos_ and _Clara Elliott_, Jul 12 2025