cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A243049 Number of simple graphs on n nodes having a unique Tutte polynomial.

Original entry on oeis.org

1, 2, 4, 7, 19, 72, 496, 6717, 183892, 9511869
Offset: 1

Views

Author

Eric W. Weisstein, May 29 2014

Keywords

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

Crossrefs

Cf. A243048 (number of non-Tutte unique graphs).
Cf. A000088 (number of simple graphs on n nodes).

Formula

a(n) = A000088(n) - A243048(n).

Extensions

a(10) from Eric W. Weisstein, Jun 09 2014
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.