登录

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

A237375型
T(n,k)=最大值加上上中位数加上下中位数再加上每个2X2子块的最小值的(n+1)X(k+1)0..2个数组的数量,与其水平和垂直相邻值相差正好一
8
81, 288, 288, 1024, 1164, 1024, 3840, 4760, 4760, 3840, 14400, 20812, 22676, 20812, 14400, 53760, 90528, 116880, 116880, 90528, 53760, 200704, 393456, 597492, 723928, 597492, 393456, 200704, 752640, 1707488, 3049632, 4429368, 4429368, 3049632
抵消
1,1
评论
表格开始
.......81.......288.......1024........3840........14400.........53760
......288......1164.......4760.......20812........90528........393456
.....1024......4760......22676......116880.......597492.......3049632
.....3840.....20812.....116880......723928......4429368......27053348
....14400.....90528.....597492.....4429368.....32296444.....234383800
....53760....393456....3049632....27053348....234383800....2025855560
...200704...1707488...15573476...165467520...1707821384...17548046424
...752640...7460608...80201408..1026092552..12676271720..155695765032
..2822400..32509760..411286836..6319203136..93083424892.1358174204976
.10536960.141269808.2099304960.38680736568.676587278680
链接
配方奶粉
k列的经验值:
k=1:a(n)=196*a(n-4),对于n>6
k=2:a(n)=370*a(n-4)-3916*a(n-8)+6904*a(-12)-1984*a(n-16),对于n>18
k=3:n>94时[订单92]
例子
n=3k=4的一些解
..1..1..2..0..1....2..0..2..0..1....1..0..1..1..1....0..2..0..2..2
..2..1..2..1..2....1..1..0..2..0....0..0..1..0..2....2..1..1..2..0
..0..1..1..0..2....1..2..1..0..0....0..2..0..1..0....0..1..2..1..2
..2..2..0..2..0....1..0..0..1..0....1..0..2..0..1....2..0..1..1..0
关键字
非n,
作者
R.H.哈丁,2014年2月7日
状态
经核准的