登录
T(n,k)=nXk 0..1阵列的数量,每个1相邻1或2个主移动相邻1。
8

%I#4 2017年11月29日06:56:43

%S 1,2,2,4,11,4,7,29,9,7,12,80104,80,12,21261467467261,21,37789,

%电话219734722197789,37,652354964526544265444996452354,651147199,

%电话:4333519094333366190943433357199114200218891955081406191

%N T(N,k)=nXk 0..1阵列的数量,每个1相邻1或2个主移动相邻1。

%C表启动

%C。。。1.....2......4........7.........12...........21.............37

%C。。。2....11.....29.......80........261..........789...........2354

%C。。。4....29....104......467.......2197.........9645..........43335

%C。。。7....80....467.....3472......26544.......190943........1406191

%C。。12...261...2197....26544.....333366......3804661.......45214991

%C。。21...789...9645...190943....3804661.....68406015.....1296880337

%C。。37..2354..43335..1406191...45214991...1296880337....39611268638

%C。。65..7199.195508.10368395..538013975..24467737897..1200659717965

%编号114.21889.876170.7606576.6343699611.457692634063.36061398110075

%H R.H.Hardin,n表,n=1..311的a(n)</a>

%F列k的经验值:

%F k=1:a(n)=2*a(n-1)-a(n-2)+a(n-3)

%Fk=2:a(n)=3*a(n-1)-a(n-2)+6*a(n-3)-8*a(n-4)

%F k=3:[顺序9]

%F k=4:【订单16】

%F k=5:[顺序35]

%F k=6:【订单73】

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

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

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

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

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

%Y列1为A005251(n+2)。

%K nonn,表

%O 1,2号机组

%A R.H.Hardin,2017年11月29日