搜索: 编号:a236804
|
|
A236804型
|
| (n+1)X(3+1)0..2阵列的数量,最大值加上下中值减去上中值减去每个2X2子块的最小值相等 |
|
+0 三
|
|
|
1033, 8825, 85929, 929447, 9558409, 107087939, 1117775361, 12821027315, 135199336873, 1580326999835, 16792477473969, 199287485892947, 2129881236360889, 25583932979862059, 274630528704260481
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
|
|
链接
|
|
|
配方奶粉
|
经验:a(n)=24*a(n-1)-55*a(n-2)-2772*a(n3)+26568*a(4-4)-71616*a(5-5)-74996*a(6-6)+644112*a(7-7)-762032*a
|
|
例子
|
n=3的一些解
..2..2..1..1....0..0..0..2....0..1..2..1....2..0..1..0....2..1..2..2
..2..1..1..0....0..1..0..1....0..2..2..0....1..0..2..0....0..2..2..1
..1..1..0..0....0..0..2..0....1..0..1..2....1..1..0..1....1..2..1..1
..1..0..0..1....2..1..0..1....0..2..0..2....1..2..2..0....1..1..1..0
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
搜索在0.003秒内完成
|