%I#4 2014年2月5日05:54:30

%电话：8126826892898492827843284328428427849628188814010888，

%电话96282891236180294562945636180289121000081205409786283436，

%电话：978621205401000083002564015202698442353636269844401520300256

%N T（N，k）=（N+1）X（k+1）0..2个数组的数量，每个2X2子块的最大值加上最小值与其水平和垂直相邻块相差正好一

%C表启动

%C。。。。。。81......268......928.....2784.....9628.....28912....100008.....300256

%C。。。。。268......984.....3284....10888....36180....120540....401520....1336540

%C。。。。。928.....3284....12014....29456....97862....269844....926086....2450048

%C。。。。2784....10888....29456....83436...233536....671080...1919288....5542856

%C。。。。9628....36180....97862...233536...721854...1737372...5299502...12992080

%C。。。28912...120540...269844...671080..1737372...5016852..13078228...34663620

%C。。100008...401520...926086..1919288..5299502..13078228..42143930...92484308

%C。。300256..1336540..2450048..5542856.12992080..34663620..92484308..257895268

%C.1038560..4448892..8256930.15833748.40059070..93075252.270710424..65055580

%编号：3118208.14811704.22301740.45309424.97555340.252437984.638608676.1691829676

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

%F列k的经验值：

%Fk=1:a（n）=8*a（n-2）+24*a（n-4）+8*a（n-6），对于n>7

%Fk=2:a（n）=a（n-1）+4*a（n-2）+5*a

%Fk=3:a（n）=5*a（n-2）+42*a（n-4）-21*a（n-6）-207*a（n-8），对于n>13

%F k=4：对于n>16，[阶数13]

%F k=5：对于n>29，[阶数26]

%F k=6:对于n>40，[订单34]

%F k=7:对于n>63，[订单56]

%e n=4 k=4的一些解

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

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

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

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

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

%K nonn，表

%O 1,1号机组

%A R.H.Hardin，2014年2月5日