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 A242791 #16 Feb 16 2025 08:33:22 %S A242791 1,1,2,6,11,34,98,408,1957,12740,108649,1281776,20787104 %N A242791 Number of connected open-bowtie-free graphs on n nodes. %C A242791 An open-bowtie graph (also known as cricket) is the graph formed by connecting two bridges, each with a single vertex to the same vertex of C3 (the cycle graph with three vertices). It is chromatically equivalent to the bull graph. %C A242791 O-\ /-O %C A242791 O | %C A242791 O-/ \-O %H A242791 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A242791 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 231ba55 %H A242791 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BullGraph.html">Bull Graph</a> %Y A242791 Cf. A079575 (bull-free graphs) %K A242791 nonn,more %O A242791 1,3 %A A242791 _Travis Hoppe_ and _Anna Petrone_, May 22 2014 %E A242791 a(11)-a(13) added using tinygraph by _Falk Hüffner_, Jan 16 2016