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 A243048 #29 Feb 16 2025 08:33:22 %S A243048 0,0,0,4,15,84,548,5629,90776,2493299 %N A243048 Number of simple graphs on n nodes having a non-unique Tutte polynomial. %C A243048 Graphs on different numbers of nodes can have identical Tutte polynomials; the numbers here represent counts of non-unique polynomials among other n-node graphs only. %H A243048 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TuttePolynomial.html">Tutte Polynomial</a> %F A243048 a(n) = A000088(n) - A243049(n). %e A243048 On 4 nodes, %e A243048 P_3 \cup K_1 and 2P_2 both have Tutte polynomial x^2 %e A243048 P_4 and K_1,3 both have Tutte polynomial x^3 %e A243048 so there are a(4) = 2 + 2 = 4 graphs with non-unique Tutte polynomials. %Y A243048 Cf. A243049 (number of Tutte-unique graphs). %Y A243048 Cf. A000088 (number of simple graphs on n nodes). %K A243048 nonn,hard,more %O A243048 1,4 %A A243048 _Eric W. Weisstein_, May 29 2014 %E A243048 a(10) from _Eric W. Weisstein_, Jun 09 2014