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 A340486 #4 Feb 12 2021 11:47:42 %S A340486 1,0,2,3,8,54,380,3462,83606,4822240 %N A340486 Number of unlabeled graphs on n vertices whose independence number is equal to clique number. %H A340486 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CliqueNumber.html">Clique number</a>. %H A340486 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependenceNumber.html">Independence Number</a>. %e A340486 a(3) = 2 because, of the four graphs of order three, only the path graph and its complement have equal independence and clique number, 2 in this case. %K A340486 nonn,more %O A340486 1,3 %A A340486 _Freddy Barrera_, Jan 09 2021