%I#7 2018年1月25日14:09:55
%S 32,641014419625732841005046117328681020118913761582,
%电话:18082055232426162932327336404034444564907538859006444,
%电话:70217632827889609679104361122068129451386414826158321688317980
%N长度为N+4 0..1的数组的数量,每N个连续的邻居对中最多有一个下降步。
%A255992第4行。
%H R.H.Hardin,n表,n=1..210的a(n)</a>
%F经验:对于n>2,a(n)=(1/6)*n^3+2*n^2+(143/6)*n+6。
%F经验公式:x*(32-64*x+36*x^2-4*x^4+x^5)/(1-x)^4_科林·巴克,2018年1月25日
%e n=4的一些解决方案:
%e。。0....1....1....1....0....1....1....1....0....1....1....0....0....1....0....0
%e。。0....1....0....1....1....1....0....0....1....0....0....0....0....0....0....1
%e。。0....1....0....0....0....0....0....0....1....0....0....0....0....1....1....0
%e。。0…..0…..0…..0…..1…..0…..1…..1…..0…..1…..0…..1…..0…..0…..0
%e。。0....0....0....1....1....1....1....0....0....1....1....1....0....1....0....1
%e。。0....0....0....1....1....1....1....0....0....1....0....0....1....1....0....1
%e。。0....0....0....0....0....1....0....0....0....1....1....0....0....1....0....1
%e。。1....1....0....0....1....1....0....1....1....1....1....0....0....1....1....0
%Y参考A255992。
%K nonn公司
%O 1,1号机组
%A R.H.Hardin,2015年3月13日
|