[go: up one dir, main page]

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!)
A359064 a(n) is the number of trees of order n such that the number of eigenvalues of the Laplacian matrix in the interval [0, 1) is equal to ceiling((d + 1)/3) = A008620(d), where d is the diameter of the tree. 0
2, 5, 7, 12, 20, 33, 52, 86, 137, 222, 353, 568, 900, 1433, 2260, 3574 (list; graph; refs; listen; history; text; internal format)
OFFSET
5,1
LINKS
Jiaxin Guo, Jie Xue, and Ruifang Liu, Laplacian eigenvalue distribution, diameter and domination number of trees, arXiv:2212.05283 [math.CO], 2022.
FORMULA
Conjecture from Guo et al.: lim_{n->oo} a(n)/A000055(n) = 0.
CROSSREFS
Sequence in context: A331529 A042065 A041793 * A333068 A029938 A213044
KEYWORD
nonn,more
AUTHOR
Stefano Spezia, Dec 15 2022
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 August 29 12:23 EDT 2024. Contains 375517 sequences. (Running on oeis4.)