login
A379574
Numbers of (not necessarily connected) uniquely graceful graphs on n vertices.
2
1, 1, 2, 5, 2, 5, 11, 33, 247, 6213
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Uniquely Graceful Graph.
MATHEMATICA
Length /@ Table[Select[GraphData["Graceful", n], GraphData[#, "GracefulLabelingCount"] == 1 &], {n, 7}]
CROSSREFS
Cf. A379573 (connected uniquely graceful graphs).
Cf. A379572 (uniquely graceful graphs with no isolated points).
Sequence in context: A299963 A107060 A016589 * A151572 A166376 A089122
KEYWORD
nonn,more,hard
AUTHOR
Eric W. Weisstein, Dec 26 2024
EXTENSIONS
a(9) from Eric W. Weisstein, Nov 12 2025
a(10) from Eric W. Weisstein, Feb 27 2026
STATUS
approved