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 A308549 #18 Feb 16 2025 08:33:55 %S A308549 1,1,2,6,18,106,819,10969 %N A308549 Number of connected graceful graphs on n vertices. %H A308549 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConnectedGraph.html">Connected Graph</a> %H A308549 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GracefulGraph.html">Graceful Graph</a> %H A308549 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/VertexCount.html">Vertex Count</a> %F A308549 a(n) = A001349(n) - A308557(n). - _Pontus von Brömssen_, Dec 29 2024 %e A308549 1 node: K_1 %e A308549 2 nodes: P_2 %e A308549 3 nodes: P_3, C_3 %e A308549 4 nodes: K_1,3 (claw), K_4-e, P_4, paw graph, C_4, K_4 %e A308549 5 nodes: K_2,3, K_1,1,3, K_1,1,1,2, P_5, S_5, W_5 (and 12 more) %Y A308549 Cf. A001349, A308548 (not necessarily connected), A308557. %K A308549 nonn,more %O A308549 1,3 %A A308549 _Eric W. Weisstein_, Jun 06 2019 %E A308549 a(8) from _Eric W. Weisstein_, Aug 16 2019