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

 


A236809型
T(n,k)=(n+1)X(k+1)0..2个数组的数量,每个2X2子块的最大值加上下中值减去上中值减去最小值
9
81, 277, 277, 1033, 1435, 1033, 4183, 8825, 8825, 4183, 17481, 60187, 85929, 60187, 17481, 75907, 410305, 929447, 929447, 410305, 75907, 330433, 2926867, 9558409, 16530709, 9558409, 2926867, 330433, 1468723, 20377961, 107087939, 270610375
抵消
1,1
评论
表格开始
.......81........277..........1033............4183..............17481
......277.......1435..........8825...........60187.............410305
.....1033.......8825.........85929..........929447............9558409
.....4183......60187........929447........16530709..........270610375
....17481.....410305.......9558409.......270610375.........6612746409
....75907....2926867.....107087939......5140896385.......203606804707
...330433...20377961....1117775361.....86863046591......5094225962785
..1468723..147734251...12821027315...1730194335025....167431587932179
..6479721.1039350577..135199336873..29809824906343...4238424064205001
.29026267.7613312515.1580326999835.613527734331097.146743496294875195
链接
配方奶粉
k列的经验值:
k=1:a(n)=5*a(n-1)+20*a(n-2)-130*a
k=2:[订单10]
k=3:[顺序11]
k=4:[顺序13]
k=5:[顺序13]
k=6:[顺序17]
k=7:[顺序16]
例子
n=3k=4的一些解
..0..0..2..2..2....0..0..2..2..2....0..0..1..1..2....0..0..2..2..1
..0..1..2..1..0....1..2..1..0..1....0..1..1..0..0....1..2..1..0..2
..2..0..2..2..0....0..0..2..2..0....1..1..2..2..1....2..0..2..2..1
..1..2..1..0..1....2..1..2..1..2....2..1..1..2..0....1..0..1..2..2
关键字
非n,
作者
R.H.哈丁2014年1月31日
状态
经核准的

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

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

上次修改时间:2024年9月21日14:48 EDT。包含376087个序列。(在oeis4上运行。)