|
|
A196692号 |
| nX4 0..4数组的数量,其中每个元素x等于其水平和垂直邻域的数量,x=0,1,2,3,4 |
|
2
|
|
|
4, 34, 408, 3394, 30971, 299031, 2810070, 26244524, 246996575, 2321651409, 21799587340, 204807147248, 1924170449803, 18075934246323, 169812333953160, 1595296606004722, 14986865956373055, 140792748879421565
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
每0紧挨着0 2,每1紧挨着1 1,每2紧挨着2 3,每3紧挨着3 0,每4紧挨着4 4
|
|
链接
|
|
|
配方奶粉
|
经验公式:a(n)=3*a(n-1)+31*a(n-2)+224*a(n3)+458*a(4-4)+311*a(-n5)-2632*a(6-6)-410*a(-7)+4610*a(8-8)+348*a(-9)+739*a(-10)-5333*a(-11)-16376*a(-12)+14097*a(-13)+20099*a(-14)-43819*a(15-a(n-16)+327 18*a(n-17)-15759*an>28时为+6*a(n-26)-2*a(n-27)
|
|
例子
|
n=5的一些解
..0..1..1..0....1..0..3..0....0..1..1..0....0..0..3..0....1..0..1..0
..0..0..0..0....1..3..0..0....0..0..0..0....1..0..0..3....1..0..1..0
..0..0..0..0....0..0..1..1....3..0..3..0....1..3..0..0....0..0..0..0
..3...0...0...0...0...3...0...0...0...0...1...0...0...3...1...1...0...3...0...0...0
..0..0..3..0....0..1..1..0....1..1..0..0....0..0..0..1....1..0..0..0
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|