搜索： 编号：a186613
|
| |
|
|
A186613号
|
| 每6 X 6个子块与每个水平和垂直相邻的6 X 6子块进行交换的（n+5）X 8二进制数组的数量。 |
|
+0个
1
|
|
|
|
140552, 5072, 6758, 30997, 172192, 614995, 1360475, 1965243, 2222975, 2268227, 2275143, 2281163, 2287191, 2293247, 2300019, 2311383, 2361616, 2636173, 3542458, 5299299, 7528860, 9808265, 12133455, 14688989, 17882279, 21932181, 26461575
(列表；图表；参考；听；历史；文本；内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：对于n>24，a（n）=a（n-1）+a（n-4）-a（n-5）+a。
|
|
|
例子
|
7 X 8的一些解决方案
..0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..0
..0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..1....0..0..0..0..0..0..0..0
..0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..0....1..0..0..0..0..0..0..0
..0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..1....0..0..0..0..0..0..0..0
..0..0..1..0..0..0..0..0....0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..0
..1.0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
..1..0..1..0..0..0..0..0....1..0..0..0..0..0..0..0....1..1..0..0..0..0..0..0
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
搜索在0.004秒内完成
|
