卡特兰数
C(n) = (2n)!/((n+1)!·n!)。前几项：1,1,2,5,14,42,132,429,1430,4862...
C(n) = (2n)!/((n+1)!·n!). 1,1,2,5,14,42,...卡特兰数计算什么
n对括号的合法匹配方式数、n+1个节点的二叉树形态数、n+2边形的三角剖分数、n×n网格不越对角线的路径数。
Counts parentheses, binary trees, triangulations, Dyck paths.C(n) = (2n)!/((n+1)!·n!)。前几项：1,1,2,5,14,42,132,429,1430,4862...
C(n) = (2n)!/((n+1)!·n!). 1,1,2,5,14,42,...n对括号的合法匹配方式数、n+1个节点的二叉树形态数、n+2边形的三角剖分数、n×n网格不越对角线的路径数。
Counts parentheses, binary trees, triangulations, Dyck paths.