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 A243049 #24 Feb 16 2025 08:33:22 %S A243049 1,2,4,7,19,72,496,6717,183892,9511869 %N A243049 Number of simple graphs on n nodes having a unique Tutte polynomial. %C A243049 Graphs on different numbers of nodes can have identical Tutte polynomials; the numbers here represent counts of unique polynomials among other n-node graphs only. %H A243049 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TuttePolynomial.html">Tutte Polynomial</a> %F A243049 a(n) = A000088(n) - A243048(n). %Y A243049 Cf. A243048 (number of non-Tutte unique graphs). %Y A243049 Cf. A000088 (number of simple graphs on n nodes). %K A243049 nonn,hard,more %O A243049 1,2 %A A243049 _Eric W. Weisstein_, May 29 2014 %E A243049 a(10) from _Eric W. Weisstein_, Jun 09 2014