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.
%I A379395 #25 Mar 30 2025 14:16:04 %S A379395 1,1,1,5,26,126,680,3876 %N A379395 Maximum number of fundamentally different graceful labelings for a simple graph of n nodes. %C A379395 The difference between "fundamentally different graceful labelings" of a graph and "graceful labelings" of a graph is that the latter is the former multiplied by twice the number of automorphisms. (The extra factor of 2 comes from complementation.) %C A379395 a(9) >= 25501. - _Eric W. Weisstein_, Mar 30 2025 %H A379395 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GracefulLabeling.html">Graceful Labeling</a>. %H A379395 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximallyGracefulGraph.html">Maximally Graceful Graph</a>. %H A379395 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SimpleGraph.html">Simple Graph</a>. %Y A379395 Cf. A339892 (maximum number of fundamentally different graceful labelings excluding graphs with isolated vertices). %K A379395 nonn,more %O A379395 1,4 %A A379395 _Eric W. Weisstein_, Dec 22 2024