%I#8 2018年1月20日12:32:06

%S 72921876561176224065983325656327512751664586047319811127139，

%电话：1683927245165434907464874628669185390485011207087215908498，

%电话：20737500267643173422983543413945546405606828312284770631

%N长度为N+5 0..2的数组的数量，每N个连续的邻居对中最多有两个下行。

%A255622第5行。

%H R.H.Hardin，<a href=“/A255627/b255627.txt”>n的表，a（n）表示n=1。.210</a>

%F经验：a（n）=（1/40320）*n^8+（19/10080）*n*7+（31/576）*n_6+（122/45）*n_25+（188527/5760）*n_3+（32263/1440）*n ^3+（276001/672）*n~2-（152493/280）*n+387，对于n>3。

%F经验g.F.：x*（729-4374*x+13122*x^2-23931*x^3+26403*x^4-15630*x^5+2474*x^6+1593*x^7+693*x^8-1849*x^9+924*x^10-153*x^11）/（1-x）^9_科林·巴克，2018年1月20日

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

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

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

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

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

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

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

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

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

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

%Y参考A255622。

%K nonn公司

%O 1,1号机组

%A.R.H.Hardin_，2015年2月28日