login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A339781
Number of homeomorphically irreducible trees with n integer labeled leaves covering an initial interval of positive integers.
2
1, 1, 2, 4, 22, 184, 2278, 37076, 747830, 17938120, 498221046, 15716127456, 554857740936, 21672428437044, 927792029298550, 43195423181912812, 2172838098801762500, 117433517088859845912, 6786305674234003471552, 417560119759063983102136, 27254276361313006814819076
OFFSET
0,3
COMMENTS
Homeomorphically irreducible trees are trees without vertices of degree 2.
LINKS
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
Row sums of A339780.
Sequence in context: A283322 A019025 A264729 * A377358 A192332 A324603
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Dec 16 2020
STATUS
approved