|
| |
|
| A250519型 |
| T（n，k）=i方向最小值（X（i，j），X（i、j-1））不减且j方向最小值不减的（n+1）X（k+1）0..3阵列的数量 |
|
9
|
|
|
|
120, 889, 889, 5996, 14660, 5996, 39187, 205022, 205022, 39187, 248942, 2817780, 5941982, 2817780, 248942, 1555689, 36999777, 166583429, 166583429, 36999777, 1555689, 9605300, 480626844, 4464289109, 9680713976, 4464289109, 480626844
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
表格开始
......120.........889...........5996.............39187...............248942
......889.......14660.........205022...........2817780.............36999777
.....5996......205022........5941982.........166583429...........4464289109
....39187.....2817780......166583429........9680713976.........529549691761
...248942....36999777.....4464289109......529549691761.......59401819473382
..1555689...480626844...117638074883....28601087487209.....6541261035659334
..9605300..6146257386..3049397341176..1507593926459193...703840057362860071
.58826247.78207667892.78567969110807.79158901718859170.75185443088320314794
|
|
|
链接
|
|
|
|
公式
|
k列的经验值：
k=1:[第7阶线性递归]
k=2:[顺序19]
k=3:[订单50]
|
|
|
示例
|
n=2k=4的一些解
..0..0..0..0..0....0..0..0..0..1....0..0..0..0..0....0..0..0..0..0
..0..2..0..3..0....0..0..2..0..1....0..0..2..1..2....0..1..0..0..0
..2..0..0..0..1....0..2..0..0..3....3..1..1..3..1....1..0..1..1..1
|
|
|
交叉参考
|
|
|
|
关键词
|
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
