|
|
250468英镑 |
| T(n,k)=在i方向上最小值(X(i,j),X(i),j-1))不减且在j方向上最小(X(i,j)、X(i-1,j))不降的(n+1)X(k+1)0..1阵列的数量 |
|
9
|
|
|
11, 31, 31, 85, 134, 85, 233, 557, 557, 233, 637, 2322, 3476, 2322, 637, 1741, 9651, 21753, 21753, 9651, 1741, 4757, 40124, 135753, 204721, 135753, 40124, 4757, 12997, 166765, 847278, 1920345, 1920345, 847278, 166765, 12997, 35509, 693150, 5286723
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
表格开始
....11.......31.........85..........233............637.............1741
....31......134........557.........2322...........9651............40124
....85......557.......3476........21753.........135753...........847278
...233.....2322......21753.......204721........1920345.........18018051
...637.....9651.....135753......1920345.......27076065........381830463
..1741....40124.....847278.....18018051......381830463.......8093522514
..4757...166765....5286723....169000988.....5383012776.....171499189113
.12997...693150...32988493...1585251989....75892576784....3634222052535
.35509..2880943..205837420..14869200736..1069934356217...77009066849457
.97013.11974176.1284368485.139470660434.15084094478445.1631841304005759
|
|
链接
|
|
|
配方奶粉
|
k列的经验值:
k=1:a(n)=3*a(n-1)-2*a(n-3)
k=2:a(n)=4*a(n-1)+3*a(n-2)-10*a(n-3)+4*a(-n-5)
k=3:[顺序9]
k=4:[顺序15]
k=5:[顺序25]
k=6:[订单41]
k=7:[订单67]
|
|
例子
|
n=3k=4的一些解
..0..0..0..1..0....0..0..0..0..0....0..0..1..0..0....1..0..0..0..0
..1..0..0..0..0....1..0..1..0..1....0..0..0..1..0....0..0..0..1..0
..0..0..0..0..0....0..1..0..0..0....0..0..0..0..1....0..0..0..0..0
..1..0..0..0..1....0..0..1..1..0....0..1..0..1..0....1..0..1..1..0
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|