

A295637


Maximum k such that there are k nonisomorphic nvertex trees with the same degree sequence.


0



1, 1, 1, 1, 1, 1, 2, 3, 5, 9, 17, 33, 73, 174, 364, 759, 1859, 4177, 8715
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,7


LINKS

Table of n, a(n) for n=0..18.
Samuel Stern, The Tree of Trees: on methods for finding all nonisomorphic treerealizations 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]


CROSSREFS

Sequence in context: A000051 A094373 A213705 * A061902 A166286 A179807
Adjacent sequences: A295634 A295635 A295636 * A295638 A295639 A295640


KEYWORD

nonn,more


AUTHOR

Eric M. Schmidt, Nov 25 2017


STATUS

approved



