|
| |
|
| A205422型 |
| T（n，k）=（n+1）X（k+1）0..3个数组的数量，每个2X2子块中向右和向下边缘的数量增加，不同于其所有水平和垂直邻域中的数量 |
|
7
|
|
|
|
256, 2768, 2768, 31216, 62716, 31216, 345008, 1448498, 1448498, 345008, 3855292, 33701202, 74565586, 33701202, 3855292, 42869296, 782598960, 3739413082, 3739413082, 782598960, 42869296, 477932092, 18167227774, 189526149374
(列表；桌子；图表；参考；听；历史；文本；内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
表格开始
........256..........2768...........31216...........345008..........3855292
.......2768.........62716.........1448498.........33701202........782598960
......31216.......1448498........74565586.......3739413082.....189526149374
.....345008......33701202......3739413082.....399249906572...42562692150766
....3855292.....782598960....189526149374...42562692150766.9958775794360374
...42869296...18167227774...9487785520264.4558547882869512
..477932092..421657055138.479223390230911
.5320759096.9789425083082
|
|
|
链接
|
|
|
|
例子
|
n=4 k=3的一些解
..3..2..2..0....1..2..0..0....3..2..0..1....2..1..1..0....0..3..3..3
..2..3..0..0....1..0..2..3....0..3..0..1....2..0..3..0....2..1..3..2
..1..0..3..0....0..1..3..2....0..0..1..2....0..2..3..0....2..2..3..3
..3..1..2..3....0..0..1..0....2..2..2..1....0..3..1..1....2..0..1..0
..3..3..0..0....1..1..2..3....3..1..3..1....1..0..0..2....1..1..2..1
|
|
|
交叉参考
|
|
|
|
关键词
|
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
