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.

A308557 Number of connected ungraceful graphs on n nodes.

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