|
|
A185849号 |
| 没有2X2子块对角线和减去反对角线总和的(n+1)X3 0..2数组的数量等于任何水平或垂直相邻的2X2个子块对角线上和减去反对角线和 |
|
1
|
|
|
630, 11610, 215880, 4004914, 74358926, 1380412312, 25625942242, 475728999902, 8831529274288, 163950562398426, 3043616539513970, 56502397501376376, 1048923589807240594, 19472460036409387670, 361491250199327640676
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
|
|
链接
|
|
|
配方奶粉
|
经验公式:a(n)=8*a(n-1)+106*a(-n2)+1154*a(n-3)+7341*a(n-15)-214035759*a(n-16)-910901251*a(n-17)+1570495381*a+18279944018*a(n-22)+20105596552*a(n-23)-48993202848*a n-34)+627769344(n-35)+55836672(n-36)
|
|
例子
|
5X3的一些解决方案
..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....1..0..0....0..0..1....0..2..0....0..0..1....1..0..0....2..0..1
..2..1..0....2..2..1....1..2..0....0..2..1....0..2..0....2..1..0....0..1..1
..1..2..0....0..2..2....2..1..2....1..0..1....2..2..2....2..0..2....0..0..1
..1..2..2....1..1..0....0..0..0....2..2..2....0..2..2....1..2..2....1..2..2
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|