|
| |
|
| A237511型 |
| T（n，k）=（n+1）X（k+1）0..2个数组的数量，其中每个2X2子块的最大值加上上中位数减去其水平和垂直相邻子块的最小值正好相差一 |
|
9
|
|
|
|
81, 328, 328, 1342, 1724, 1342, 5622, 9108, 9108, 5622, 23545, 50876, 62031, 50876, 23545, 97700, 284368, 462206, 462206, 284368, 97700, 406008, 1553960, 3489965, 4882448, 3489965, 1553960, 406008, 1690160, 8478776, 25188644, 52177092
(列表;桌子;图表;参考文献;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
表格开始
.......81........328........1342..........5622...........23545
......328.......1724........9108.........50876..........284368
.....1342.......9108.......62031........462206.........3489965
.....5622......50876......462206.......4882448........52177092
....23545.....284368.....3489965......52177092.......785179913
……97700……1553960……25188644……519582770……10729163264
...406008....8478776...180995914....5108133318....144998701422
..1690160...46757986..1323886040...52155298022...2060542176864
..7044600..257959884..9750862216..537071054554..29631609284098
.29290848.1416477192.70896853212.5420999342862.413277799902244
|
|
|
链接
|
|
|
|
配方奶粉
|
第k列的经验值：
k=1:a（n）=208*a（n-4）+1448*a
k=2:【订单29】
|
|
|
例子
|
n=3k=4的一些解
..0..1..2..0..1....0..1..1..0..0....0..2..2..1..2....0..2..1..2..2
..1..1..0..0..2....1..1..1..1..0....1..0..1..2..0....1..0..2..2..2
..1..1..1..2..0....1..1..2..0..1....1..0..2..0..1....1..1..0..1..1
..0..1..1..1..0....1..0..1..2..1....1..2..1..1..1....0..2..2..1..0
|
|
|
交叉参考
|
|
|
|
关键词
|
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
