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 A380740 #4 Jan 31 2025 09:24:52 %S A380740 1,1,1,1,2,2,7,13,25,17 %N A380740 Number of smallest fully n-forested graphs. %H A380740 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FullyForestedGraph.html">Fully Forested Graph</a>. %Y A380740 Cf. A004401 (edge counts of smallest fully forested graphs). %K A380740 nonn,hard,more %O A380740 1,5 %A A380740 _Eric W. Weisstein_, Jan 31 2025