|
| |
|
| A205417型 |
| 在每个2X2子块中，（n+1）X2 0..3个数组的数量增加，向右和向下边缘的数量不同于其所有水平和垂直邻域中的数量 |
|
1
|
|
|
|
256, 2768, 31216, 345008, 3855292, 42869296, 477932092, 5320759096, 59277447518, 660147565952, 7353260497347, 81897935985740, 912200639448047, 10160026458425994, 113163447362993509, 1260415842112508290
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验公式：a（n）=84*a（n-2）+324*a（n-3）+684*a 16）+31001606*a（n-17）-11675195*a（-18）-49570054*a（-19）+20905770*a（-20）+96572572*a（-21）+51717035*a（-2-22）-40813940*a（n-23）-122930663*a+11734912*a（n-37）+5189888*a（n-42）-16384*a（n-43）对于n>44
|
|
|
例子
|
n=4的一些解
..3..0....2..0....0..1....1..3....1..1....2..0....1..0....1..1....3..1....3..2
..1..1....0..1....0..0....1..0....1..1....3..1....0..0....3..3....1..2....2..0
..2..2....3..2....1..1....0..1....2..1....1..0....0..3....3..2....0..3....2..3
..2..2....2..0....3..0....0..2....2..3....0..2....1..2....0..1....0..0....0..0
..1..2....3..0....0..3....3..2....0..0....0..3....1..0....2..1....0..0....2..3
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
