OFFSET
0,7
LINKS
Samuel Stern, The Tree of Trees: on methods for finding all non-isomorphic tree-realizations of degree sequences, Honors Thesis, Wesleyan University, 2017.
EXAMPLE
There are 2 nonisomorphic trees with degree sequence [1, 1, 1, 2, 2, 3]. It is impossible to improve on this, so a(6) = 2. [Stern, p. 39]
PROG
(Sage) # from Max Alekseyev, Jul 22 2024
from collections import Counter
a295637 = lambda n: max( Counter(tuple(sorted(T.degree())) for T in graphs.trees(n)).values() )
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Eric M. Schmidt, Nov 25 2017
EXTENSIONS
a(19)-a(24) from Max Alekseyev, Jul 22 2024
STATUS
approved