%I#5 2012年3月31日12:36:06
%S 401505999955892136047526766994710363600965968206676908987,
%电话:69194956930031694083169543556980043707184775120238708687,
%电话:1060230313875155190340592434739317018283982328148652486587445171008156
%N个(N+5)X12二进制阵列,每个6X6子块与每个水平和垂直相邻6X6子块交换
%A186619第7列
%H R.H.Hardin,n表,n=1..36的a(n)</a>
%F经验:对于n>24,a(n)=a(n-1)+a(n-4)-a(n-5)+a(n-6)-a(n-7)-a(n-10)+a(n-11)+a(n-12)-a(n-16)
%e 7X12的一些解决方案
%e。。0...0...0...0...0...0...0...0...0...0...1...0...0...0...0...0...0...0...0...0...0...0...0...1...0
%e。。0..0..0..0..0..0..0..0..0..0..1..1....0..0..0..0..0..0..0..0..0..0..0..0
%e。。0..0..0..0..0..0..0..0..0..0..1..0....0..0..0..0..0..0..0..0..0..0..0..0
%e。。0..0..0..0..0..0..0..0..0..0..0..1....0..0..0..0..0..0..0..0..0..0..0..0
%e。。0..0..0..0..0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..0..0..0..0..1
%e。。0..0..1..0..0..0..0..0..0..0..0..0....0..1..0..1..0..0..0..0..0..0..0..0
%e。。0..0..1..0..0..0..0..0..0..0..0..0....0..1..0..0..0..0..0..0..0..0..0..0
%K nonn公司
%O 1,1号机组
%A R.H.Hardin _ 2011年2月24日
|