|
|
A237067型 |
| T(n,k)=每个2X2子块的最大值加上上中值加上最小值减去下中值等于的(n+1)X(k+1)0..2数组的数量 |
|
9
|
|
|
81, 255, 255, 826, 1101, 826, 2823, 5034, 5034, 2823, 9815, 25451, 32336, 25451, 9815, 34996, 132095, 243256, 243256, 132095, 34996, 125469, 723774, 1812742, 2913981, 1812742, 723774, 125469, 457125, 3983941, 15086720, 33501807, 33501807
(列表;桌子;图表;参考文献;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
表格开始
......81.......255.........826...........2823.............9815
.....255......1101........5034..........25451...........132095
.....826......5034.......32336.........243256..........1812742
....2823.....25451......243256........2913981.........33501807
....9815....132095.....1812742.......33501807........541432879
…34996…723774…15086720…454477716…11326961712
..125469...3983941...119493128.....5566497747.....191474736979
..457125..22797711..1047778362....80054821507....4316927906497
1664894.129296092.8543176066.1006565794326.74651943281780
.6142099.756671245.77036901078.14930004573317.1774932657426997
|
|
链接
|
|
|
配方奶粉
|
k列的经验值:
k=1:[第13阶线性递归]
k=2:【订单23】
k=3:[顺序64]
|
|
例子
|
n=3k=4的一些解
..0..0..2..2..2....0..1..2..1..2....0..0..0..0..1....0..2..1..0..1
..1..2..1..2..1....2..0..2..2..2....1..2..1..2..2....1..0..2..2..2
..2..2..0..2..0....1..2..1..2..1....2..0..2..2..1....0..2..1..2..1
..0..1..2..1..2....0..2..2..2..0....0..1..2..1..1....1..2..2..0..2
|
|
交叉参考
|
|
|
关键字
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|