搜索: 编号:a237636
|
|
A237636型
|
| (n+1)X(7+1)0..2个阵列的数量,每个2X2子块的上中值与其水平和垂直邻居相差恰好一 |
|
+0个 1
|
|
|
30656, 16448, 4132, 5976, 7756, 11984, 18344, 23968, 35732, 47936, 71426, 95872, 140200, 191744, 286672, 383488, 560800, 766976, 1146688, 1533952, 2243200, 3067904, 4586752, 6135808, 8972800, 12271616, 18347008, 24543232, 35891200
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
|
|
链接
|
|
|
配方奶粉
|
经验:n>15时,a(n)=4*a(n-4)
|
|
例子
|
n=5的一些解
..1..0..0..2..1..0..1..1....0..2..1..0..1..2..0..0....0..0..1..2..0..0..0..2
..2..1..0..1..2..0..0..0....0..1..2..0..0..0..2..1....1..0..2..1..0..1..2..0
..1..2..0..0..0..2..1..0....0..0..0..2..1..0..1..2....0..2..0..0..0..2..1..0
..0..0..2..1..0..1..2..0....2..1..0..1..2..0..0..0....2..1..0..1..2..0..0..0
..1..0..1..2..0..0..0..2....1..2..0..0..0..2..1..0....0..0..0..2..1..0..1..2
..1..0..0..0..2..1..0..1....1..0..2..1..0..1..2..0....0..1..2..0..0..0..1..2
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
已批准
|
|
|
搜索在0.031秒内完成
|