login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245881 Number of distinct Tutte polynomials among all connected graphs on n nodes. 0
1, 1, 2, 5, 16, 73, 532, 7245, 192605, 9717156 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..10.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, Discr. Appl. Math. 201 (2016) 172-181.

Eric Weisstein's World of Mathematics, Tutte Polynomial

CROSSREFS

Cf. A243049 (simple graphs, including disconnected ones, with unique Tutte polynomials).

Sequence in context: A251684 A129092 A110710 * A078639 A002632 A020127

Adjacent sequences:  A245878 A245879 A245880 * A245882 A245883 A245884

KEYWORD

nonn,hard,more

AUTHOR

Travis Hoppe and Anna Petrone, Aug 05 2014

EXTENSIONS

Terms corrected by Eric M. Schmidt, Mar 20 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)