A380740 Number of smallest fully n-forested graphs.
1, 1, 1, 1, 2, 2, 7, 13, 25, 17
Offset: 1
Links
- Eric Weisstein's World of Mathematics, Fully Forested Graph.
Crossrefs
Cf. A004401 (edge counts of smallest fully forested graphs).
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.