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.

Showing 1-3 of 3 results.

A309757 Number of simple connected graphs that have distinct degree sequences among all connected graphs with n nodes.

Original entry on oeis.org

1, 1, 1, 2, 6, 17, 45, 99, 238, 549, 1296
Offset: 0

Views

Author

Andrew Howroyd, Aug 15 2019

Keywords

Links

Crossrefs

Cf. A001349, A007721, A122423, A365548.

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.

Links

Crossrefs

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

A182159 a(n) = A000088(n) - A004251(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 3, 54, 702, 11133, 270307, 11989152, 1018938516, 165090950475, 50502030531637, 29054155654068636, 31426485969792266148, 64001015704527511927449, 245935864153532932507714067, 1787577725145611700547202431284, 24637809253125004524383004890760310
Offset: 0

Views

Author

Jonathan Vos Post, Apr 15 2012

Keywords

Crossrefs

Cf. A000088, A004251, A122423.

Formula

a(n) = A000088(n) - A004251(n).

Extensions

Edited by Alois P. Heinz, Aug 15 2019
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.