Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Sep 08 2023 13:02:17
%S 1,1,2,6,16,42,96,234,546,1292
%N Number of unigraphic graphs on n nodes that are connected.
%C a(n) <= A309757(n) since this sequence excludes connected graphs that share a degree sequence with one or more disconnected graphs.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/UnigraphicGraph.html">Unigraphic Graph</a>
%Y Cf. A122423 (not-necessarily connected unigraphs).
%Y Cf. A309757 (connected graphs that have distinct degree sequences among all connected graphs).
%K nonn,more
%O 1,3
%A _Eric W. Weisstein_, Sep 08 2023