|
|
A257887
|
|
Number of proper diagonals of the n-dimensional associahedron (i.e., diagonals that are not included in lower dimension faces).
|
|
4
|
|
|
1, 5, 34, 273, 2436, 23391, 237090, 2505228, 27360612, 306956091, 3521389998, 41164654020, 489017000736, 5890746106977, 71829149873286, 885296835708778, 11015753148497480, 138241674405266782, 1748203287998505712, 22261537862360050040, 285268915333307553016
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) is also the number of pairs of triangulations of an (n+3)-gon that have no diagonals in common.
|
|
REFERENCES
|
D. Huguet and D. Tamari, La structure polyedrale des complexes de parenthesages, J. Combinatorics, Information & System Sciences 3 (1978) pages 69-81
|
|
LINKS
|
Dimbinaina Ralaivaosaona, Jean Bernoulli Ravelomanana, Stephan Wagner, Counting Planar Tanglegrams, LIPIcs Proceedings of Analysis of Algorithms 2018, Vol. 110. Article 32.
|
|
MATHEMATICA
|
nmax = 23; A = Sum[CatalanNumber[n]^2*x^(n+1), {n, 0, nmax}]+O[x]^(nmax+1); B = InverseSeries[A, x] // Normal; Drop[CoefficientList[(-B+x-x^2)/2, x], 3] (* Jean-François Alcover, Feb 20 2017, after F. Chapoton *)
|
|
PROG
|
(PARI) seq(n)={Vec(x - x^2 - serreverse(sum(k=0, n+1, (binomial(2*k, k)/(k+1))^2*x^(k+1)) + O(x^(n+3))))/2} \\ Andrew Howroyd, Mar 18 2018
(Sage)
x = PowerSeriesRing(QQ, 'x').gen()
N = 30
A = sum(catalan_number(n) ** 2 * x ** (n + 1) for n in range(N)).O(N + 1)
B = A.reverse()
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|