The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #16 Feb 27 2026 14:24:02
%S 1,1,2,5,2,5,11,33,247,6213
%N Numbers of (not necessarily connected) uniquely graceful graphs on n vertices.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UniquelyGracefulGraph.html">Uniquely Graceful Graph</a>.
%t Length /@ Table[Select[GraphData["Graceful", n], GraphData[#, "GracefulLabelingCount"] == 1 &], {n, 7}]
%Y Cf. A379573 (connected uniquely graceful graphs).
%Y Cf. A379572 (uniquely graceful graphs with no isolated points).
%K nonn,more,hard
%O 1,3
%A _Eric W. Weisstein_, Dec 26 2024
%E a(9) from _Eric W. Weisstein_, Nov 12 2025
%E a(10) from _Eric W. Weisstein_, Feb 27 2026