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 A048192 #42 Feb 16 2025 08:32:39 %S A048192 1,1,2,5,15,58,272,1614,11911,109539,1247691,17566431,305310547, %T A048192 6558690953,174688164414 %N A048192 Number of connected chordal graphs on n vertices. %H A048192 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 6e0a59d %H A048192 Tim Kemp, <a href="http://essay.utwente.nl/82685/1/Kemp-MA-EEMCS.pdf">An algorithmic approach to a conjecture of Chvátal on toughness and hamiltonicity of graphs</a>, M. Sc. Thesis, University of Twente (Netherlands, 2020). %H A048192 B. D. McKay, <a href="http://users.cecs.anu.edu.au/~bdm/data/graphs.html">Chordal graphs</a> %H A048192 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ChordalGraph.html">Chordal Graph</a> %H A048192 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConnectedGraph.html">Connected Graph</a> %F A048192 a(n) = A048193(n) - A287427(n). - _Eric W. Weisstein_, May 25 2017 %F A048192 Inverse Euler transform of A048193. - _Andrew Howroyd_, Nov 03 2017 %Y A048192 Cf. A048193 (not-necessarily connected chordal graphs). %Y A048192 Cf. A287427 (disconnected chordal graphs). %Y A048192 Cf. A048194. %K A048192 nonn,nice,more %O A048192 1,3 %A A048192 _Gordon F. Royle_ %E A048192 a(12) added by _Gordon F. Royle_, Aug 05 2008 %E A048192 a(13) and a(14) added using tinygraph by _Falk Hüffner_, Jan 15 2016 %E A048192 a(15) added by _Brendan McKay_, Jan 07 2019