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 A122423 #18 Feb 21 2024 14:36:25 %S A122423 1,2,4,11,28,72,170,407,956,2252 %N A122423 Number of unigraphic degree sequences among all graphs (connected or otherwise) on n vertices. %C A122423 A degree sequence is unigraphic if there is only one graph (up to isomorphism) with that degree sequence. %H A122423 Michael Koren, <a href="https://doi.org/10.1016/S0095-8956(76)80006-8">Pairs of Sequences with a Unique Realization by Bipartite Graphs</a>, Journal of Combinatorial Theory B, 21, 224-234, 1976. %H A122423 Michael Koren, <a href="https://doi.org/10.1016/S0095-8956(76)80007-X">Sequences with a Unique Realization by Simple Graphs</a>, Journal of Combinatorial Theory B, 21, 234-244, 1976. %H A122423 Shuo-Yen R Li, <a href="https://doi.org/10.1016/0095-8956(75)90072-6">Graphic Sequences with Unique Realizations</a>, Journal of Combinatorial Theory B, 19, 42-68, 1975. %H A122423 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UnigraphicGraph.html">Unigraphic Graph</a>. %Y A122423 Cf. A365548 (number of unigraphic graphs on n nodes that are connected). %Y A122423 Cf. A309757 (number of connected graphs that have distinct degree sequences among all connected graphs). %K A122423 nonn,more %O A122423 1,2 %A A122423 _Gordon F. Royle_, Sep 03 2006