[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A365548
Number of unigraphic graphs on n nodes that are connected.
2
1, 1, 2, 6, 16, 42, 96, 234, 546, 1292
(list; graph; refs; listen; history; text; internal format)
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
Table of n, a(n) for n=1..10.
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
Adjacent sequences: A365545 A365546 A365547 * A365549 A365550 A365551
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Sep 08 2023
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 19:25 EST 2024. Contains 377536 sequences.
License Agreements, Terms of Use, Privacy Policy