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-2 of 2 results.

A308548 Number of (not necessarily connected) graceful graphs on n vertices.

Original entry on oeis.org

1, 1, 2, 7, 22, 126, 959, 12046
Offset: 1

Views

Author

Eric W. Weisstein, Jun 06 2019

Keywords

Links

Crossrefs

Cf. A000088, A308549 (connected graceful graphs), A308556.

Formula

a(n) = A000088(n) - A308556(n). - Pontus von Brömssen, Dec 29 2024

Extensions

a(8) from Eric W. Weisstein, Aug 16 2019

A308557 Number of connected ungraceful graphs on n nodes.

Original entry on oeis.org

0, 0, 0, 0, 3, 6, 34, 148
Offset: 1

Views

Author

Eric W. Weisstein, Jun 07 2019

Keywords

Links

Crossrefs

Cf. A001349, A308549, A308556 (not necessarily connected ungraceful graphs).

Formula

a(n) = A001349(n) - A308549(n). - Pontus von Brömssen, Dec 29 2024

Extensions

a(8) from Eric W. Weisstein, Aug 16 2019
Showing 1-2 of 2 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.