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

 


A236884型
T(n,k)=(n+1)X(k+1)0..2个数组的数量,每个2 X 2子块的最大值加上上中位数加上下中位数相等。
9
81, 211, 211, 537, 669, 537, 1523, 2111, 2111, 1523, 4309, 7995, 7900, 7995, 4309, 12723, 29673, 40199, 40199, 29673, 12723, 37701, 117703, 189527, 316921, 189527, 117703, 37701, 113771, 462885, 1031110, 2265637, 2265637, 1031110, 462885
抵消
1,1
评论
表格开始
......81......211.......537.........1523..........4309...........12723
.....211......669......2111.........7995.........29673..........117703
.....537.....2111......7900........40199........189527.........1031110
....1523.....7995.....40199.......316921.......2265637........19772641
....4309....29673....189527......2265637......23065072.......308682677
...12723...117703...1031110.....19772641.....308682677......6486271600
...37701...462885...5389465....163853211....3749944595....120596994045
..113771..1868937..30143115...1470283561...50416764317...2482328271821
..344885..7534429.165929972..12922658673..649519074615..48561262896722
.1055235.30744153.944003155.117130624281.8682755057576.984788620200753
链接
配方奶粉
k列的经验值:
k=1:[16阶线性递归]
k=2:[订单31]
k=3:[订单63]
例子
n=3,k=4的一些解
..2..2..2..2..1....0..2..1..2..1....2..2..2..2..2....2..2..0..2..1
..2..2..2..2..2....2..1..2..0..2....2..2..2..0..2....0..2..2..2..2
..2..2..1..2..1....2..1..2..1..2....2..2..2..2..2....2..2..2..2..0
..1..2..2..2..2....2..1..2..1..2....1..2..0..2..1....1..2..1..2..2
关键字
非n,
作者
R.H.哈丁2014年2月1日
状态
经核准的

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

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

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