login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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