搜索： 编号：a236792
|
| |
|
|
A236792型
|
| 最大值加上上中位数加上每个2X2子块的最小值等于的（n+1）X（2+1）0..2数组的数量 |
|
+0
1
|
|
|
|
255, 1231, 6217, 34163, 191657, 1116735, 6597729, 39752795, 241456349, 1481423855, 9128173539, 56528510141, 350835283263, 2182763442241, 13595247632269, 84778601345407, 528959639062227, 3302250773429227
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
公式
|
经验公式：a（n）=15*a（n-1）-9*a（n-2）-880*a（n-3）+3426*a a（n-15）+124420915*a（n-16）-4267235783*a-9593628558*a（n-21）+15912829245*a（n-22）+4511594574*a 26368*a（n-34）-6334080*a（n-35）+1095936*a
|
|
|
例子
|
n=5的一些解
..0..2..0....1..0..1....0..2..0....0..1..2....1..1..0....0..0..2....1..2..0
..0..2..0....0..2..0....2..2..2....2..0..1....2..0..2....2..2..1....0..2..0
..2..0..2....0..1..0....2..0..2....1..1..2....0..1..0....0..2..0....1..2..2
..2..1..2....2..0..2....1..2..2....2..0..0....2..1..2....0..2..1....2..0..0
..0..2..0....0..1..1....0..2..0....0..1..2....0..0..1....0..2..0....1..2..2
..1..2..1....2..1..1....2..2..2....2..0..0....1..2..1....0..2..0....2..0..1
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
搜索在0.002秒内完成
|
