| 显示1-1个结果（共1个）。
第页1
半长n的Dyck路径的数量A（n，k）正好有两次（可能重叠）出现由k的二进制展开式给出的连续步长模式，其中1=U=（1,1）和0=D=（1，-1）；正方形阵列A（n，k），n>=0，k>=0，由反对角线读取。
+0
14
0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 6, 0, 0, 0, 0, 0, 0, 6, 10, 0, 0, 0, 0, 0, 1, 2, 20, 15, 0, 0, 0, 0, 0, 0, 3, 15, 50, 21, 0, 0, 0, 0, 0, 0, 2, 12, 69, 105, 28, 0, 0, 0, 0, 0, 0, 1, 15, 40, 252, 196, 36, 0, 0, 0, 0, 0, 0, 0, 5, 69, 135, 804, 336, 45, 0, 0
例子
方阵A（n，k）开始：
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
2, 2, 1, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 3, 1, 0, 1, 0, 0, 0, 0, ...
0, 0, 6, 6, 2, 3, 2, 1, 0, 0, ...
0, 0, 10, 20, 15, 12, 15, 5, 0, 2, ...
0, 0, 15, 50, 69, 40, 69, 24, 3, 15, ...
0, 0, 21, 105, 252, 135, 252, 98, 28, 69, ...
0, 0, 28, 196, 804, 441, 804, 378, 180, 273, ...
0, 0, 36, 336, 2349, 1428, 2349, 1386, 954, 1056, ...
搜索在0.007秒内完成
| 