A371161 Maximum number of unlabeled graphs with at most n nodes such that neither one is a subgraph of another.
1, 1, 1, 2, 3, 7, 26, 157, 1687
Offset: 0
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.
Comments