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 A371161 #8 Oct 04 2024 18:50:34 %S A371161 1,1,1,2,3,7,26,157,1687 %N A371161 Maximum number of unlabeled graphs with at most n nodes such that neither one is a subgraph of another. %C A371161 Width of the poset of unlabeled graphs of order at most n with the subgraph relationship. %C A371161 a(n) >= A000717(n). %Y A371161 Cf. A000717, A006897, A371162. %K A371161 nonn,more,hard %O A371161 0,4 %A A371161 _Max Alekseyev_, Mar 13 2024