搜索: 编号:a235902
|
|
A235902型
|
| T(n,k)=每个2X2子块中最小值加最大值等于下中值加上上中值的(n+1)X(k+1)0..2数组的数量 |
|
+0个 9
|
|
|
33, 125, 125, 473, 641, 473, 1797, 3265, 3265, 1797, 6849, 17001, 21697, 17001, 6849, 26189, 89857, 148945, 148945, 89857, 26189, 100457, 482809, 1030145, 1384257, 1030145, 482809, 100457, 386517, 2633969, 7234417, 12931393, 12931393, 7234417
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
表格开始
......33.......125.........473..........1797...........6849............26189
.....125.......641........3265.........17001..........89857...........482809
.....473......3265.......21697........148945........1030145..........7234417
....1797.....17001......148945.......1384257.......12931393........124394337
....6849.....89857.....1030145......12931393......160019457.......2053474753
...26189....482809.....7234417.....124394337.....2053474753......35883075329
..100457...2633969....51386977....1221438401....26681279873.....632701301249
..386517..14575785...369219409...12293017761...354762714433...11571312666753
.1491537..81703841..2679887681..126561018497..4797433339137..216925831550465
.5771933.463238873.19633204273.1332373322337.66057474247873.4198207054934401
|
|
链接
|
|
|
配方奶粉
|
k列的经验值(明显重复出现2k+1级):
k=1:a(n)=7*a(n-1)-10*a(n-2)-8*a(n-3)
k=2:a(n)=13*a(n-1)-44*a(n-2)-24*a
k=3:[顺序7]
k=4:[顺序9]
k=5:[顺序11]
k=6:[顺序13]
k=7:[顺序15]
|
|
例子
|
n=3k=4的一些解
..0..1..2..2..1....1..2..1..1..0....1..2..1..2..1....1..2..0..1..0
..2..1..2..2..1....1..2..1..1..2....0..1..0..1..0....2..1..1..0..1
..1..0..1..1..2....0..1..2..0..1....1..0..1..2..1....0..1..1..0..1
..1..2..1..1..0....1..0..1..1..2....1..2..1..0..1....0..1..1..2..1
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
搜索在0.005秒内完成
|