|
| |
|
| A243638型 |
| 长度为n+2 0..7的数组的数量，一行中没有三个不相等的元素，并以0..7的顺序引入了新值0..7。 |
|
1
|
|
|
|
4, 9, 21, 51, 127, 324, 844, 2243, 6073, 16737, 46905, 133556, 386062, 1132106, 3365610, 10137369, 30919271, 95444507, 298042003, 941032182, 3002839544, 9679707876, 31506186516, 103497873819, 342976360273, 1146003129573
(列表;图表;参考文献;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
链接
|
|
|
|
配方奶粉
|
经验公式：a（n）=13*a（n-1）-56*a（n-2）+44*a（n3）+305*a（4-4）-633*a（5-5）-476*a。
经验公式：x*（4-43*x+128*x^2+106*x^3-976*x^4+392*x^5+2696*x*6-1239*x^7-3714*x^8+363*x^9+2016*x*10+576*x^11）/（1-x）*（1+x）**（1-2*x-6*x^2））-科林·巴克2018年11月2日
|
|
|
示例
|
n=6的一些解决方案：
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....1....0....0....1....1....1....1....0....1....0....1....0
..1....1....0....1....1....1....1....1....1....1....1....1....1....1....1....1
..0....0....1....1....0....1....1....2....1....0....0....0....2....0....2....0
..1....1....0....1....0....2....1....2....2....0....0....0....2....0....2....1
..0....1....1....1....1....1....0....0....2....1....2....1....2....0....0....0
..0....1....1....2....0....1....1....0....3....0....0....1....2....0....2....0
..0....0....1....1....1....1....0....3....3....0....0....2....2....0....0....1
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
