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 A243781 #15 Feb 26 2025 02:40:16 %S A243781 0,0,1,4,11,34,103,405,1892,12166 %N A243781 Number of simple connected graphs on n nodes whose independence number a(g)=2. %C A243781 The independence number of a graph is the cardinality of the largest independent vertex set. %H A243781 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243781 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 A243781 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependenceNumber.html">Independence Number</a>, <a href="https://mathworld.wolfram.com/MaximumIndependentVertexSet.html">Maximum Independent Vertex Set</a> %Y A243781 Column 2 of A294490. %Y A243781 Cf. Values of a(g) for simple connected graphs, A243781, A243782, A243783, A243784. %K A243781 nonn,more %O A243781 1,4 %A A243781 _Travis Hoppe_ and _Anna Petrone_, Jun 20 2014