搜索: 编号:a296668
|
|
A296668型
|
| n X 2 0..1阵列的数量,每个1与0相邻,2或3个主移动相邻1。 |
|
+0 1
|
|
|
3, 10, 25, 68, 208, 609, 1785, 5375, 16174, 48589, 146652, 443220, 1339225, 4049457, 12250187, 37060306, 112130705, 339304900, 1026763976, 3107142321, 9402919993, 28455721175, 86115053750, 260609950693, 788686494268, 2386813930604
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
偏移
|
1,1
|
|
链接
|
|
|
配方奶粉
|
经验:a(n)=3*a(n-1)+5*a(n-3)-10*a(4-4)-12*a(5-5)-4*a(6-6)。
经验公式:x*(3+x-5*x^2-22*x^3-16*x^4-4*x^5)/(1-3*x-5*x^3+10*x^4+12*x^5+4*x^6)-科林·巴克2019年2月24日
|
|
例子
|
n=7的一些解决方案:
..1..0. .0..0. .0..0. .1..0. .0..0. .1..1. .0..0. .1..0. .0..1. .0..0
..1..1. .0..0. .1..1. .1..1. .1..1. .1..0. .0..0. .0..0. .0..0. .1..0
..0..0. .0..1. .0..1. .0..0. .1..1. .1..0. .0..0. .0..1. .0..1. .0..0
..0..0. .1..1. .1..0. .1..1. .0..0. .1..0. .1..0. .1..1. .0..0. .1..1
..0..0. .0..1. .0..1. .0..1. .0..0. .1..0. .1..1. .1..0. .0..1. .1..0
..0..1. .1..0. .1..0. .0..0. .0..1. .0..1. .0..0. .0..0. .0..0. .0..0
..0..0. .1..1. .1..1. .0..1. .0..0. .1..1. .1..0. .1..0. .0..0. .0..1
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
搜索在0.016秒内完成
|