|
|
A259115
|
|
Number of unrooted binary ordered tanglegrams of size n.
|
|
3
|
|
|
1, 1, 1, 2, 4, 31, 243, 3532, 62810, 1390718, 36080361, 1076477512, 36281518847, 1363869480379, 56587508558171, 2569141702825037, 126714642738385906, 6747643861563535720, 385875940575529343271, 23588199955061659841248, 1535037278334227258123709, 105961521687913311720698169
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Binary tanglegrams are pairs of bifurcating (degree 3 internal node) trees with a bijection between the leaves of the trees. Two tanglegrams are isomorphic if there is an isomorphism between the trees that preserves the bijection. Unrooted means that the tanglegram is composed of unrooted trees, and ordered means that the trees are considered as an ordered pair.
|
|
LINKS
|
|
|
PROG
|
(PARI) \\ See links in A339645 for combinatorial species functions.
rootedBinTrees(n)={my(v=vector(n)); v[1]=sv(1); for(n=2, n, v[n]=(sum(j=1, n-1, v[j]*v[n-j]) + if(n%2, 0, sRaiseCI(v[n/2], n/2, 2)))/2); x*Ser(v)}
cycleIndexSeries(n)={my(g=rootedBinTrees(n), u = g + (sRaise(g, 3) - g^3)/3); sCartProd(u, u)}
NumUnlabeledObjsSeq(cycleIndexSeries(12)) \\ Andrew Howroyd, Dec 24 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|