登录

年度呼吁:请向OEIS基金会捐款支持OEIS的持续开发和维护。现在是我们的第61年,我们有超过378000个序列,我们已经被引用了11000次(通常说“多亏了OEIS才被发现”)。

237368英镑
最大值加上上中位数加上下中位数再加上每个2X2子块的最小值的(n+1)X(1+1)0..2数组的数量,与水平和垂直相邻块相差正好一
1
81, 288, 1024, 3840, 14400, 53760, 200704, 752640, 2822400, 10536960, 39337984, 147517440, 553190400, 2065244160, 7710244864, 28913418240, 108425318400, 404787855360, 1511207993344, 5667029975040, 21251362406400, 79338419650560
抵消
1,1
评论
第1列,共列A237375型
链接
配方奶粉
经验:对于n>6,a(n)=196*a(n-4)
例子
n=5的一些解
..2..2....0..2....0..1....0..2....1..1....2..1....2..0....2..2....0..2....2..1
..2..0....2..2....2..1....1..2....1..1....1..2....2..0....2..1....1..2....2..2
..1..2....2..1....2..0....0..1....1..0....1..1....1..2....2..1....2..1....2..0
..0..1....1..2....0..2....0..2....1..2....2..0....1..2....2..0....2..2....2..1
..1..1....0..2....0..1....0..2....1..1....0..1....0..2....2..2....2..0....2..1
..0..0....2..0....1..2....1..2....2..2....1..2....2..0....2..1....1..2....2..2
关键字
非n
作者
R.H.哈丁,2014年2月7日
状态
经核准的