登录
OEIS由OEIS基金会的许多慷慨捐赠者.

 


A186218号
T(n,k)=每个2X2子块行列式等于某个水平或垂直相邻2X2个子块行列列式的(n+1)X(k+1)0..2个数组的数目
8
0, 175, 175, 609, 1969, 609, 3593, 18873, 18873, 3593, 15055, 197619, 308593, 197619, 15055, 76263, 2008031, 6275745, 6275745, 2008031, 76263, 353985, 20738153, 116461359, 255375977, 116461359, 20738153, 353985, 1729733, 213108423
抵消
1,2
评论
表格开始
........0.........175..........609...........3593..........15055..........76263
......175........1969........18873.........197619........2008031.......20738153
......609.......18873.......308593........6275745......116461359.....2259545215
.....3593......197619......6275745......255375977.....9406230423...363322785761
....15055.....2008031....116461359.....9406230423...660028898887.49524283508081
....76263....20738153...2259545215...363322785761.49524283508081
...353985...213108423..43035959317.13767728347159
..1729733..2194753479.826432933951
..8225815.22587046821
.39664199
链接
例子
4X3的一些解决方案
..1..0..0....0..0..1....2..2..2....2..0..2....2..2..2....1..2..0....1..2..1
..1..0..1....2..0..2....2..1..0....0..0..1....1..1..1....0..0..0....0..0..0
..2..0..1....1..0..0....0..0..0....0..0..2....1..1..1....2..2..2....0..1..2
..0..0..1....0..0..0....2..0..1....1..0..0....2..1..0....0..0..0....0..1..2
关键字
非n,
作者
R.H.哈丁2011年2月15日
状态
经核准的

查找|欢迎光临|维基|注册|音乐|地块2|演示|索引|浏览|网络摄像头
贡献新序列。或评论|格式|样式表|变换|超级搜索|最近
OEIS社区|维护人OEIS基金会。

许可协议、使用条款、隐私政策。.

上次修改时间:美国东部夏令时2024年9月21日11:40。包含376084个序列。(在oeis4上运行。)