显示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 13
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 132, 0, 0, 0, 0, 0, 0, 132, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 196, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 28, 1176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 336, 5292, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 2520, 19404, 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, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
132, 132, 1, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 21, 1, 0, 1, 0, 0, 0, 0, 1, ...
0, 0, 196, 28, 0, 7, 0, 1, 0, 0, 1, ...
0, 0, 1176, 336, 0, 56, 0, 9, 0, 0, 15, ...
0, 0, 5292, 2520, 0, 336, 0, 80, 0, 0, 64, ...
搜索在0.070秒内完成
|