登录
A236875号
T(n,k)=每个2X2子块的最大值加上上中位数减去下中位数等于的(n+1)X(k+1)0..2数组的数量
9
81, 287, 287, 1069, 1503, 1069, 4131, 8117, 8117, 4131, 16153, 46023, 61750, 46023, 16153, 63867, 260957, 499947, 499947, 260957, 63867, 253269, 1502355, 4012441, 5913287, 4012441, 1502355, 253269, 1008347, 8629071, 32940090, 68777909
抵消
1,1
评论
表格开始
.......81........287.........1069...........4131............16153
......287.......1503.........8117..........46023...........260957
.....1069.......8117........61750.........499947..........4012441
.....4131......46023.......499947........5913287.........68777909
....16153.....260957......4012441.......68777909.......1152135751
....63867....1502355.....32940090......826928057......20189154641
...253269....8629071....268846043.....9850162103.....349860145439
..1008347...49869905...2216853503...119172787543....6195176587117
..4017129..287699673..18216556210..1434649920667..109117758402260
.16029051.1664594799.150477516769.17412329016137.1943713366918835
链接
配方奶粉
k列的经验值:
k=1:[16阶线性递归]
k=2:[顺序37]
k=3:[顺序96]
例子
n=3k=4的一些解
..0..0..0..1..2....0..1..2..0..2....0..1..1..0..0....0..0..2..2..1
..2..0..2..1..0....1..2..2..2..2....1..0..2..1..1....1..1..1..2..2
..1..1..1..0..1....2..2..2..0..2....0..1..1..0..0....2..1..2..2..2
..0..0..0..1..2....0..2..0..0..0....1..0..2..1..1....0..1..0..2..2
关键词
非n,
作者
R.H.哈丁2014年2月1日
状态
经核准的