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.
2, 5, 7, 12, 20, 33, 52, 86, 137, 222, 353, 568, 900, 1433, 2260, 3574
Offset: 5
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.