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 A243783 #14 Feb 26 2025 02:40:22 %S A243783 0,0,0,0,1,13,205,4308,135563,7161399 %N A243783 Number of simple connected graphs on n nodes whose independence number a(g)=4. %C A243783 The independence number of a graph is the cardinality of the largest independent vertex set. %H A243783 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243783 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 A243783 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 A243783 Column 4 of A294490. %Y A243783 Cf. Values of a(g) for simple connected graphs, A243781, A243782, A243783, A243784. %K A243783 nonn,more %O A243783 1,6 %A A243783 _Travis Hoppe_ and _Anna Petrone_, Jun 20 2014