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 A198634 #69 Feb 16 2025 08:33:16 %S A198634 1,2,4,11,33,152,1006,11805,257542,11011758,917095022,145164791300 %N A198634 Number of weakly perfect graphs on n nodes. %C A198634 A graph is weakly perfect if it has equal chromatic and clique numbers. %C A198634 First differs from A287007 (fractional chromatic number equals chromatic number) at a(8). - _Eric W. Weisstein_, May 17 2017 %H A198634 <a href="/A198634/b198634.txt">Table of n, a(n) for n = 1..12</a> %H A198634 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 4361e42 %H A198634 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WeaklyPerfectGraph.html">Weakly Perfect Graph</a> %F A198634 a(n) = A287009(n) + A287023(n). %Y A198634 Cf. A287007, A287009, A287023. %K A198634 nonn,more %O A198634 1,2 %A A198634 _Eric W. Weisstein_, Feb 19 2013 %E A198634 a(10) from _Eric W. Weisstein_, May 17 2017 %E A198634 a(11) added using tinygraph by _Falk Hüffner_, Aug 13 2017 %E A198634 a(12) added using tinygraph by _Jakub Jablonski_, Sep 26 2020