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 A243800 #14 Feb 16 2025 08:33:22 %S A243800 0,0,0,5,20,16,22,29,37,46 %N A243800 Number of simple connected graphs on n nodes whose maximum size of an independent edge set is equal to 2. %C A243800 An independent edge set is a subset of the edges such that no two edges in the subset share a vertex. A maximum independent edge set is an independent edge set containing the largest possible number of edges among all independent edge sets. %C A243800 The maximum size of an independent edge set is also called the matching number of the graph. - _Andrew Howroyd_, Sep 05 2019 %H A243800 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243800 T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014 %H A243800 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MatchingNumber.html">Matching Number</a> %H A243800 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximumIndependentEdgeSet.html">Maximum Independent Edge Set</a> %Y A243800 Column k=2 of A325304. %Y A243800 Cf. A243801 (max size of independent edge set=3). %K A243800 nonn,more %O A243800 1,4 %A A243800 _Travis Hoppe_ and _Anna Petrone_, Jul 15 2014