|
| |
|
| A237385型 |
| 用每个2X2子块的最大值加上上中位数减去最小值着色的（n+1）X（1+1）0..2数组的数量 |
|
1
|
|
|
|
81, 434, 2336, 12624, 68064, 366568, 1976940, 10657560, 57441532, 309578264, 1668794652, 8995139000, 48484851148, 261335232440, 1408647749404, 7592807398296, 40926289471308, 220597727495896, 1189054017281884
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：a（n）=30*a（n-3）+349*a（n-4）+818*a（n5）+3504*a（6-6）+7320*a（7-7）+9876*a（8-8）+18056*a（-9）-14960*a（-10）-63872*a（-11）-133008*a（-12）-307168*a（-13）-194624*a（-14）+71296*a（-15）+344832*a（-16）+1077248*a（-1-17）+985088*a（n-18）-16384*a（n-19）-212992*a（n-20）
|
|
|
例子
|
n=5的一些解
..2..1....1..1....1..1....0..2....2..1....2..2....2..0....2..0....1..1....0..1
..0..0....2..1....1..1....2..1....2..0....1..2....2..1....0..0....2..0....2..1
..0..2…..0..0…..2..2…..1..2…..1..1…..1..1…..0..0…..0..0…..0..2…..0..2
..0..2....0..2....1..0....1..1....1..0....0..2....1..1....0..2....1..1....0..0
..0..0....1..2....0..1....2..0....2..2....0..0....2..0....0..2....1..1....1..0
..0..1....0..1....2..2....2..1....1..1....1..2....2..2....1..0....0..1....1..2
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
