|
|
A282130型 |
| T(n,k)=nXk 0..2数组的数量,其中没有元素不等于四个以上的主移动邻居,只有一个元素例外,并且新值按0的顺序向上引入。 |
|
6
|
|
|
0, 0, 0, 0, 0, 0, 0, 30, 30, 0, 0, 412, 1826, 412, 0, 0, 4018, 14952, 14952, 4018, 0, 0, 35472, 137676, 210308, 137676, 35472, 0, 0, 296062, 1032030, 2582100, 2582100, 1032030, 296062, 0, 0, 2378276, 7679079, 27360940, 36329997, 27360940, 7679079
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,8
|
|
评论
|
表格开始
.0.........0..........0...........0...........0............0............0
.0.........0.........30.........412........4018........35472.......296062
.0........30.......1826.......14952......137676......1032030......7679079
.0.......412......14952......210308.....2582100.....27360940....288592122
.0......4018.....137676.....2582100....36329997....474264964...6056577995
.0.....35472....1032030....27360940...474264964...7788462424.124826907672
.0....296062....7679079...288592122..6056577995.124826907672
.0...2378276...54233948..2859154700.73617080694
.0..18602538..376415512.28049884760
.0.142686584.2558365766
|
|
链接
|
|
|
配方奶粉
|
k列的经验值:
k=1:a(n)=a(n-1)
k=2:[顺序8]
k=3:n>33时[订单30]
k=4:对于n>87,[订单80]
|
|
例子
|
n=3 k=4的一些解
..0..0..1..1. .0..1..1..1. .0..1..1..2. .0..1..1..0. .0..1..1..0
..1..1..1..1. .2..1..1..1. .1..1..1..0. .1..1..2..1. .1..0..1..0
..2..0..1..1. .2..2..0..0. .2..1..2..2. .0..1..2..1. .0..1..1..1
|
|
交叉参考
|
|
|
关键字
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|