The number of unlabeled trees T on n vertices for which maximum multiplicity attained by any matrix whose graph is T implies the simplicity of its other eigenvalues.

A347018

The number of unlabeled trees T on n vertices for which maximum multiplicity attained by any matrix whose graph is T implies the simplicity of its other eigenvalues.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =5a(6) =8a(7) =14a(8) =24a(9) =43a(10) =74a(11) =134a(12) =238a(13) =433a(14) =778a(15) =1416a(16) =2564a(17) =4676a(18) =8498a(19) =15507a(20) =28246a(21) =51568a(22) =94049a(23) =171734a(24) =313417a(25) =572377a(26) =1044986a(27) =1908527a(28) =3485092a(29) =6365294

External references