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