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.

A308556 Number of (not necessarily connected) ungraceful graphs on n nodes.

Original entry on oeis.org

0, 1, 2, 4, 12, 30, 85, 300
Offset: 1

Views

Author

Eric W. Weisstein, Jun 07 2019

Keywords

Crossrefs

Cf. A000088, A308548, A308557 (connected ungraceful graphs).

Formula

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

Extensions

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