搜索: 编号:a204795
|
|
A204795型
|
| 具有所有2X2子块行列式的行和列的(n+1)X4 0..1数组的数量按字典顺序不变 |
|
+0 1
|
|
|
125, 1001, 6537, 42214, 270148, 1729515, 11096511, 71369791, 459554519, 2960897995, 19082285695, 122998524851, 792865245671, 5111098107899, 32948570941935, 212404040448451, 1369275577457015, 8827137858045451
(列表;图表;参考文献;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
|
|
链接
|
|
|
公式
|
经验:对于n>15,a(n)=10*a(n-1)-17*a(n-2)-64*a(n3)+168*a
|
|
例子
|
n=4的一些解
..1..0..0..0....1..1..1..0....1..1..0..0....0..1..1..1....1..1..1..1
..1.0...0...1...0...0...0...0...1...0...0...1...0...1...0...1...0...0...0...0...0
..0..0..0..1....0..1..1..1....0..0..0..1....1..0..0..1....1..1..1..0
..1..0..0..0....0..0..0..0....0..1..0..0....0..0..0..0....1..1..1..1
..0..0..0..1....1..0..1..1....0..1..0..1....1..1..1..1....0..0..0..1
|
|
关键字
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
搜索在0.005秒内完成
|