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

 


A237412号
T(n,k)=(n+1)X(k+1)0..2个数组的数量,其中最大值加上上中位数,再加上每个2X2子块的最小值,每个子块与其水平和垂直相邻块的差值正好为1。
9
81, 322, 322, 1278, 1632, 1278, 5228, 8236, 8236, 5228, 21456, 44186, 53167, 44186, 21456, 87164, 238640, 373804, 373804, 238640, 87164, 354008, 1260486, 2671962, 3604930, 2671962, 1260486, 354008, 1441060, 6627450, 18401364, 35476776
抵消
1,1
评论
表格开始
.......81.......322........1278..........5228...........21456............87164
......322......1632........8236.........44186..........238640..........1260486
.....1278......8236.......53167........373804.........2671962.........18401364
.....5228.....44186......373804.......3604930........35476776........330330878
....21456....238640.....2671962......35476776.......480758688.......6045609040
....87164...1260486....18401364.....330330878......6045609040.....101410470742
...354008...6627450...125750824....3029315052.....74740595664....1668740442760
..1441060..35198148...872440876...28551327846....958854072908...28739211200900
..5874828.187296514..6089994150..271444171644..12448856412422..500884807969628
.23898504.992298282.42113161848.2547123932136.158549359318752.8543128692901112
链接
配方奶粉
k列的经验值:
k=1:[16阶线性递归]
k=2:[顺序37]
例子
n=3k=4的一些解
..0..2..1..2..0....0..2..1..0..1....0..2..0..0..2....0..2..1..1..2
..1..1..1..2..0....0..0..0..1..2....1..0..2..1..2....0..0..0..1..0
..0..0..2..0..1....2..1..1..2..0....1..1..1..1..0....1..0..2..1..1
..1..2..0..1..0....1..1..1..1..0....2..0..0..2..2....1..0..1..1..1
关键词
非n,
作者
R.H.哈丁,2014年2月7日
状态
经核准的

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

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

上次修改时间:美国东部夏令时2024年9月20日06:04。包含376025个序列。(在oeis4上运行。)