%I#5 2012年3月31日12:36:01
%S 6891100941100941414514393637117145143919143309125979493,
%电话:12597949319143309264517911368049335710547044473680493557,
%电话:2645179113635551053120704709680930052757680930052757120704703909
%N T(N,k)=每个3X3子块奇异的(N+2)X(k+2)0..2个阵列的数量
%C表启动
%C。。。。。。。。。6891………..100941……..1451439……..19143309
%C。。。。。。。100941.........3637117........125979493........3680493357
%C。。。。。。1451439.......125979493......10547404447......680930052757
%C。。。。。19143309......3680493357.....680930052757....69241919671789
%C。。。。264517911....120704703909...54363498790639.10528776249588829
%C。。。3635551053...3913579500845.4325955651178757
%C。。49631761863.125215483941877
%编号680594596269
%H R.H.Hardin,n表,n=1..40的a(n)</a>
%e 5X4的一些解决方案
%e。。0..0..0..0....1..0..0..0....0..0..0..0....0..0..0..0....1..0..0..0
%e。。0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0
%e。。1..1..0..0....0..0..0..0....0..0..0..0....0..1..0..2....0..1..0..0
%e。。1..2..1..1....0..0..1..0....1..0..2..1....0..0..0..0....2..0..2..1
%e。。0..1..1..1....2..2..0..2....0..0..2..1....1..2..2..1....0..0..0..0
%K nonn,表
%O 1,1号机组
%A R.H.Hardin _ 2011年1月22日
|