|
|
A243831型 |
| 半长n的Dyck路径的数量A(n,k)正好有五次(可能重叠)出现由k的二进制展开式给出的连续步长模式,其中1=U=(1,1),0=D=(1,-1);方阵A(n,k),n>=0,k>=0。 |
|
13
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0, 0, 0, 1, 105, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 490, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 196, 1764, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 1176, 5292, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 42, 0, 5292, 13860, 0, 0
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
0,21
|
|
链接
|
|
|
例子
|
方阵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, ...
42, 42, 1, 0, 0, 0, 0, 0, 0, 0, 0, ...
0,0,15,1,0,1,0,0,0,0,1。。。
0, 0, 105, 21, 0, 6, 0, 1, 0, 0, 1, ...
0, 0, 490, 196, 0, 42, 0, 8, 0, 0, 13, ...
0, 0, 1764, 1176, 0, 224, 0, 63, 0, 0, 52, ...
0, 0, 5292, 5292, 42, 1134, 42, 390, 0, 0, 244, ...
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|