OFFSET
0,3
COMMENTS
Homeomorphically irreducible trees are trees without vertices of degree 2.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..200
PROG
(PARI)
EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
R(n, k)={my(v=[k]); for(n=2, n, v=concat(v, EulerT(concat(v, [0]))[n])); v}
U(n, k)={my(g=x*Ser(R(n, k))); Vec(1 + g + k*x*g - g^2)}
seq(n)={sum(k=0, n, U(n, k)*sum(r=k, n, binomial(r, k)*(-1)^(r-k)) )}
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Dec 16 2020
STATUS
approved