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 A333728 #28 Dec 21 2020 17:13:42 %S A333728 1,2,12,48,168,1152,9600,97920 %N A333728 Maximum number of graceful labelings for a simple graph on n nodes. %C A333728 a(9) >= 1491840 (K_1,1,7). %C A333728 Table of graphs achieving these maxima: %C A333728 1: K_1 %C A333728 2: K_2 = P_2 %C A333728 3: K_3 = C_3 = K_1,1,1 %C A333728 4: K_4 %C A333728 5: K_1,1,3 %C A333728 6: K_1,1,4 %C A333728 7: K_1,1,5 %C A333728 8: K_1,1,6 %C A333728 a(4) fails to correspond to the diamond graph K_1,1,2 since K_4 has 48 graceful labelings, while K_1,1,2 has only 32. %Y A333728 Cf. A334307, A339892. %K A333728 nonn,more %O A333728 1,2 %A A333728 _Eric W. Weisstein_, Apr 03 2020 %E A333728 a(8) from _Eric W. Weisstein_, Jul 30 2020