%I#4 2016年2月19日09:52:09
%S 0,4,4,24,96,2410811521208431142431296114244321620,
%电话:103488715320715320103488162058328890561502409637963968,
%电话:150240968890565832204127375872300056400185632500018563250003000564007375872
%N T(N,k)=带有某些元素和一些水平或垂直相邻邻居的nXk 0..3阵列的数量,总共三个,正好一次。
%C表启动
%C。。。。。。0..........4.............24................108....................432
%C。。。。。。4.........96...........1152..............11424.................103488
%C。。。。。24.......1152..........31296.............715320...............15024096
%C。。。。108......11424.........715320...........37963968.............1856325000
%C。。。。432.....103488.......15024096.........1856325000...........211625837280
%C。。。1620.....889056......300056400........86415197088.........22984646281176
%C。。。5832....7375872.....5795398368......3892946216856.......2416707037884480
%C。。20412…59698464…109294975080…171307237216320…248267055360211392
%C。。69984..474360768..2024660774592...7406621052177000...25062609875880382656
%编号:236196.3715826016.36988673403168.315868041326151072.2495854741014485439624
%H R.H.Hardin,n表,n=1..264的a(n)</a>
%F列k的经验值:
%F k=1:a(n)=6*a(n-1)-9*a(n-2)
%F k=2:当n>3时,a(n)=14*a(n-1)-49*a(n-2)
%Fk=3:a(n)=36*a(n-1)-378*a(n-2)+972*a(n-3)-729*a(n-4),对于n>5
%F k=4:对于n>7,[顺序6]
%F k=5:对于n>15,[订单14]
%F k=6:对于n>27,[订单26]
%F k=7:对于n>65,[顺序64]
%e n=3 k=4的一些解
%e。。0..1..3..2. .0..0..2..2. .2.2.2.2.3。0..2..2...0。0..0..1..1
%e。。0..3..1..0. .0..2..3..3. .0..2..2..2. .0..2..0..0. .0..2..0..0
%e。。0..2..3..2. .1..1..1..3. .2..0..0..3. .0..2..3..2. .2..2..1..1
%Y列1为A120908。
%K nonn,表
%O 1,2号机组
%A R.H.Hardin,2016年2月19日
|