login

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”).

A365548
Number of unigraphic graphs on n nodes that are connected.
2
1, 1, 2, 6, 16, 42, 96, 234, 546, 1292
OFFSET
1,3
COMMENTS
a(n) <= A309757(n) since this sequence excludes connected graphs that share a degree sequence with one or more disconnected graphs.
LINKS
Eric Weisstein's World of Mathematics, Unigraphic Graph
CROSSREFS
Cf. A122423 (not-necessarily connected unigraphs).
Cf. A309757 (connected graphs that have distinct degree sequences among all connected graphs).
Sequence in context: A158920 A263592 A178438 * A143123 A102699 A266124
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Sep 08 2023
STATUS
approved