The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243049 Number of simple graphs on n nodes having a unique Tutte polynomial. 2
1, 2, 4, 7, 19, 72, 496, 6717, 183892, 9511869 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
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.
LINKS
Eric Weisstein's World of Mathematics, Tutte Polynomial
FORMULA
a(n) = A000088(n) - A243048(n).
CROSSREFS
Cf. A243048 (number of non-Tutte unique graphs).
Cf. A000088 (number of simple graphs on n nodes).
Sequence in context: A367440 A101569 A225435 * A247234 A327444 A291403
KEYWORD
nonn,hard,more
AUTHOR
Eric W. Weisstein, May 29 2014
EXTENSIONS
a(10) from Eric W. Weisstein, Jun 09 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 18:46 EDT 2024. Contains 372720 sequences. (Running on oeis4.)