|
|
A205912型 |
| 每个2 X 2子块具有相同顺时针边数的(n+1)X 4 0..2数组的数量随着其水平邻域的增加而增加,相同逆时针边数随着其垂直邻域的增多而增加。 |
|
1
|
|
|
1764, 9831, 87918, 875760, 8986929, 93488811, 976932162, 10250633343, 107760730911, 1134683089512, 11958281270577, 126112581616143, 1330517219011788, 14041341384337191, 148208705188726647
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
|
|
链接
|
|
|
配方奶粉
|
经验公式:a(n)=16*a(n-1)-8*a(n-2)-775*a(-n3)+2020*a(n4)+10484*a(v-5)-34209*a(6-6)-68090*a(7-7)+249504*a(8-8)+300963*a(-9)-1131752*a(-10)-899412*a 96*a(n-16)+2186200*a当n>32时,-3579296*a(n-22)-391776*a(n-23)+1328736*a(-n24)-428352*a(n25)+34560*a(7-26)。
|
|
例子
|
n=4的一些解决方案:
..1..2..0..1....1..2..0..2....1..0..0..2....0..0..0..0....2..1..0..2
..2..2..0..0....1..2..2..2....1..0..2..2....2..2..2..2....1..2..1..0
..1..2..0..1....2..2..0..2....0..0..2..1....1..1..1..1....2..1..2..1
..2..2..0..0....2..0..0..0....2..2..2..2....2..2..1..2....0..2..0..2
..0..0..0..2....2..2..2..2....2..0..0..2....2..1..1..2....2..0..1..0
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|