搜索： 身份证号码：a237630
|
| |
|
|
A237630型
|
| （n+1）X（1+1）0..2数组的数量，每个2X2子块的上中位数与其水平和垂直相邻块相差正好一。 |
|
+0
1
|
|
|
|
81, 260, 702, 1786, 4621, 11936, 30656, 77576, 200452, 515424, 1325424, 3365664, 8687760, 22278912, 57336960, 145904256, 376379712, 963592704, 2481143040, 6321940992, 16301843712, 41692741632, 107387375616, 273842325504
(列表；图表；参考；听；历史；文本；内部格式)
|
|
|
|
偏移
|
1,1
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：当n>9时，a（n）=36*a（n-4）+48*a（n-6）。
经验公式：x*（81+260*x+702*x^2+1786*x^3+1705*x^4+2576*x|5+1496*x*6+800*x^7+400*x*8）/（1-36*x^4-48*x^6）-科林·巴克2018年10月23日
|
|
|
例子
|
n=5的一些解决方案：
..2..2....0..0....2..2....2..0....2..2....1..2....0..1....2..2....2..0....2..1
..0..1..1...0..1..1..1..1...2...0..1..2...0...0...1...2...1...2...1...2...1...2...0...0
..2..0....0..2....0..0....0..0....2..1....1..0....1..2....1..0....0..0....2..0
..0..2....2..1....1..0....1..0....1..2....0..0....0..2....0..0....0..2....0..1
..1..0....0..0....2..1....0..2....0..0....2..1....1..1....2..1....1..0....0..0
..0..0....0..2....2..1....1..2....0..1....2..2....2..2....1..2....2..2....1..1
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
搜索在0.003秒内完成
|
