Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Dec 15 2024 09:30:23
%S 1,2,16,144,1428,25328,631026,25087224
%N Total number of graceful labelings of all simple graphs on n nodes.
%C Counts are for all labelings, not just fundamental ones, so includes labelings that are equivalent under the graph's automorphism group and via subtractive complementation. - _Eric W. Weisstein_, Dec 15 2024
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GracefulLabeling.html">Graceful Labeling</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SimpleGraph.html">Simple Graph</a>.
%K nonn,more,hard,changed
%O 1,2
%A _Eric W. Weisstein_, Apr 03 2020
%E a(8) from _Eric W. Weisstein_, Jul 30 2020