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.

This page as a plain text file.
%I A308556 #20 Feb 16 2025 08:33:55
%S A308556 0,1,2,4,12,30,85,300
%N A308556 Number of (not necessarily connected) ungraceful graphs on n nodes.
%H A308556 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GracefulGraph.html">Graceful Graph</a>
%F A308556 a(n) = A000088(n) - A308548(n). - _Pontus von Brömssen_, Dec 29 2024
%Y A308556 Cf. A000088, A308548, A308557 (connected ungraceful graphs).
%K A308556 nonn,more
%O A308556 1,3
%A A308556 _Eric W. Weisstein_, Jun 07 2019
%E A308556 a(8) from _Eric W. Weisstein_, Aug 16 2019