|
| |
|
| A237412号 |
| T（n，k）=（n+1）X（k+1）0..2个阵列的数量，其最大值加上上中值加上每个2X2子块的最小值，每个2X2子块与其水平和垂直邻居相差恰好一。 |
|
9
|
|
|
|
81, 322, 322, 1278, 1632, 1278, 5228, 8236, 8236, 5228, 21456, 44186, 53167, 44186, 21456, 87164, 238640, 373804, 373804, 238640, 87164, 354008, 1260486, 2671962, 3604930, 2671962, 1260486, 354008, 1441060, 6627450, 18401364, 35476776
(列表；桌子；图表；参考；听；历史；文本；内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
表格开始
.......81.......322........1278..........5228...........21456............87164
......322......1632........8236.........44186..........238640..........1260486
.....1278......8236.......53167........373804.........2671962.........18401364
.....5228.....44186......373804.......3604930........35476776........330330878
……21456……238640……2671962……35476776……480758688……6045609040
....87164...1260486....18401364.....330330878......6045609040.....101410470742
...354008...6627450...125750824....3029315052.....74740595664....1668740442760
..1441060..35198148...872440876...28551327846....958854072908...28739211200900
..5874828.187296514..6089994150..271444171644..12448856412422..500884807969628
.23898504.992298282.42113161848.2547123932136.158549359318752.8543128692901112
|
|
|
链接
|
|
|
|
公式
|
k列的经验值：
k=1:[16阶线性递归]
k=2:[顺序37]
|
|
|
示例
|
n=3 k=4的一些解
..0..2..1..2..0....0..2..1..0..1....0..2..0..0..2....0..2..1..1..2
..1..1..1..2..0....0..0..0..1..2....1..0..2..1..2....0..0..0..1..0
..0..0..2..0..1....2..1..1..2..0....1..1..1..1..0....1..0..2..1..1
..1..2..0..1..0....1..1..1..1..0....2..0..0..2..2....1..0..1..1..1
|
|
|
交叉参考
|
|
|
|
关键词
|
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
