|
|
A236124号 |
| 用最大值加上每个2X2子块的上中位数减去下中位数着色的(n+1)X(1+1)0..3数组的数量 |
|
1
|
|
|
256, 2782, 30660, 337810, 3723012, 41005528, 451716944, 4976199592, 54818616784, 603883903276, 6652433429276, 73283772351660, 807300186654896, 8893283636544700, 97969139280841724, 1079236054749770148
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
|
|
链接
|
|
|
配方奶粉
|
经验公式:a(n)=366*a(n-3)+5214*a(n-4)+31156*a(n5)+218596*a(6-6)+873948*a(-n7)+2635751*a(8-8)+5977356*a(n-16)+105162595088*a(n-17)+148035552816*a(-n18)+69121017376*a(n-19)-49448957456*a(n20)-2549401014912*a(n-21)-3683380168064*a a(n-32)+167599333048320(n-33)+6043975286784(n-34)-84314060488704*a(n-35)-108348177383424*a
|
|
例子
|
n=3的一些解
..2..1....2..3....2..3....2..0....3..0....2..1....2..0....0..1....3..0....0..0
..0..0....1..1....3..3....0..2....1..0....0..2....3..0....0..0....3..0....0..0
..0..1....3..0....2..2....0..0....0..0....2..2....3..3....3..1....3..2....1..1
..0..1....0..3....2..0....2..3....2..3....1..1....0..0....3..0....2..0....0..3
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|