cp's OEIS Frontend

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.

A365548 Number of unigraphic graphs on n nodes that are connected.

Original entry on oeis.org

1, 1, 2, 6, 16, 42, 96, 234, 546, 1292
Offset: 1

Views

Author

Eric W. Weisstein, Sep 08 2023

Keywords

Comments

a(n) <= A309757(n) since this sequence excludes connected graphs that share a degree sequence with one or more disconnected graphs.

Crossrefs

Cf. A122423 (not-necessarily connected unigraphs).
Cf. A309757 (connected graphs that have distinct degree sequences among all connected graphs).