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 A365548 #8 Feb 16 2025 08:34:06 %S A365548 1,1,2,6,16,42,96,234,546,1292 %N A365548 Number of unigraphic graphs on n nodes that are connected. %C A365548 a(n) <= A309757(n) since this sequence excludes connected graphs that share a degree sequence with one or more disconnected graphs. %H A365548 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UnigraphicGraph.html">Unigraphic Graph</a> %Y A365548 Cf. A122423 (not-necessarily connected unigraphs). %Y A365548 Cf. A309757 (connected graphs that have distinct degree sequences among all connected graphs). %K A365548 nonn,more %O A365548 1,3 %A A365548 _Eric W. Weisstein_, Sep 08 2023