|
| |
|
| A266316型 |
| 包含0..n-1的2个副本的n X 2数组的数量，没有元素1大于其西邻或北邻模n，且左上角元素等于0。 |
|
0
|
|
|
|
1, 0, 2, 35, 1007, 54819, 4318217, 458508379, 62976460150, 10860600443527, 2297243685069637, 584799993257765106
(列表；图表；参考；听；历史；文本；内部格式)
|
|
|
|
偏移
|
1,3
|
|
|
评论
|
|
|
|
链接
|
|
|
|
例子
|
n=4的一些解决方案：
..0..2....0..3....0..2....0..2....0..3....0..2....0..3....0..3....0..3....0..2
..0..2....3..2....2..1....2..1....0..3....3..1....2..1....0..2....3..1....0..2
..3..1....2..1....1..3....1..0....2..1....2..1....2..1....3..2....2..1....3..1
..3..1....1..0....0..3....3..3....2..1....0..3....0..3....1..1....2..0....1..3
|
|
|
交叉参考
|
|
|
|
关键词
|
非n,更多,已更改
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
