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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2017 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226594 Number of distinct characteristic polynomials of trees with n nodes. 0
1, 1, 1, 2, 3, 6, 11, 22, 42, 102, 204, 488, 1078, 2723, 6403 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

D. M. Cvetković, M. Doob and H. Sachs, Spectra of graphs. Theory and applications, Johann Ambrosius Barth, Heidelberg, 1995

LINKS

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

PROG

(Sage) [len(Set([t.charpoly() for t in graphs.trees(n)])) for n in range(1, 8)]

CROSSREFS

Cf. A000055.

Sequence in context: A002083 A124973 A318123 * A043327 A247968 A005578

Adjacent sequences:  A226591 A226592 A226593 * A226595 A226596 A226597

KEYWORD

nonn,more

AUTHOR

F. Chapoton, Jun 13 2013

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 10 05:49 EST 2018. Contains 318044 sequences. (Running on oeis4.)