|
| |
|
| A237391号 |
| T（n，k）=（n+1）X（k+1）0..2数组的数量，用最大值加上上中值减去每个2X2子块的最小值着色 |
|
7
|
|
|
|
81, 434, 434, 2336, 3240, 2336, 12624, 24340, 24340, 12624, 68064, 183764, 255937, 183764, 68064, 366568, 1379886, 2712486, 2712486, 1379886, 366568, 1976940, 10406596, 28732972, 41204198, 28732972, 10406596, 1976940, 10657560, 78612538
(列表;桌子;图表;参考文献;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1，1
|
|
|
评论
|
表格开始
........81.........434..........2336..........12624...........68064
.......434........3240.........24340.........183764.........1379886
......2336.......24340........255937........2712486........28732972
.....12624......183764.......2712486.......41204198.......629612266
.....68064.....1379886......28732972......629612266.....14010191373
....366568....10406596.....306543648.....9678405410....312459028946
...1976940....78612538....3277420369...148794944054...6958669132771
..10657560...593121116...34947393232..2283761004002.154932883163426
..57441532..4469323758..371861162189.34983096932494
.309578264.33698637958.3961014934240
|
|
|
链接
|
|
|
|
配方奶粉
|
k列的经验值：
k=1:[20阶线性递归]
k=2:[订单58]，对于n>59
|
|
|
例子
|
n=2 k=4的一些解
..1..0..2..2..2....0..2..0..0..1....1..0..0..2..1....0..0..1..2..2
..0..0..0..2..2....2..0..0..0..1....0..1..2..1..0....0..1..0..0..0
..2..1..0..1..0....1..0..0..2..0....1..2..0..1..1....1..0..2..0..1
|
|
|
交叉参考
|
|
|
|
关键词
|
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
