This site is supported by donations to The OEIS Foundation.



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

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245880 Number of distinct characteristic polynomials among all connected graphs on n nodes. 0
1, 1, 2, 6, 21, 111, 821, 10423, 236064, 10375796 (list; graph; refs; listen; history; text; internal format)



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, Characteristic Polynomial


Cf. A082104 (simple graphs, including disconnected ones, with unique characteristic polynomials).

Sequence in context: A156808 A245882 A267653 * A076324 A303032 A076325

Adjacent sequences:  A245877 A245878 A245879 * A245881 A245882 A245883




Travis Hoppe and Anna Petrone, Aug 05 2014


Terms corrected by Eric M. Schmidt, Mar 20 2015



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 5 17:42 EST 2019. Contains 329768 sequences. (Running on oeis4.)