%I#7 2018年1月26日06:15:34

%第12825635445156870585410161192138315901814205623172598页，

%电话：2900322435713942433847605209568661926728729578948526，

%电话：919298931063011404122161306713958148901586416881179421904820200

%N长度为N+6 0..1的数组的数量，每N个连续的邻居对中最多有一个下降步。

%A255992第6行。

%H R.H.Hardin，n表，n=1..210的a（n）</a>

%F经验：对于n>4，a（n）=（1/6）*n^3+3*n^2+（533/6）*n+28。

%F经验公式：x*（128-256*x+98*x ^2+59*x ^3-8*x ^4-21*x ^5-8*x ^6+9*x ^7）/（1-x）^4_科林·巴克，2018年1月26日

%e n=4的一些解决方案：

%e。。0....0....0....1....1....0....1....0....1....1....1....0....1....0....0....0

%e。。1....1....0....1....1....1....1....1....0....1....0....1....0....0....0....0

%e。。0....0....0....0....0....0....1....0....0....0....0....1....0....1....1....0

%e。。0....0....1....0....0....0....1....0....0....0....0....0....0....1....1....0

%e。。1....1....0....0....0....1....1....1....1....0....0....0....0....0....0....0

%e。。1….1….0….0….0….1….1….1….1….0….1….0….0….0….0….1

%e。。0....0....0....0....0....1....1....1....1....0....0....1....1....0....1....1

%e。。1....0....0....0....0....1....0....0....1....1....1....1....1....1....1....1

%e。。1....1....0....0....0....1....1....0....1....1....1....0....0....1....0....1

%e。。1....1....0....1....0....1....1....0....0....1....1....0....1....0....1....0

%Y参考A255992。

%K nonn公司

%O 1,1号机组

%A R.H.Hardin，2015年3月13日