登录
296739英镑
T(n,k)=n X k 0..1阵列的数量,每个1与1、2或4个主移动相邻1。
8
1, 2, 2, 4, 11, 4, 7, 31, 31, 7, 12, 88, 126, 88, 12, 21, 287, 575, 575, 287, 21, 37, 881, 2832, 4251, 2832, 881, 37, 65, 2686, 13322, 34086, 34086, 13322, 2686, 65, 114, 8347, 62874, 261354, 458494, 261354, 62874, 8347, 114, 200, 25763, 299056, 2009116
抵消
1,2
评论
表格开始
...1.....2.......4.........7..........12...........21.............37
...2....11......31........88.........287..........881...........2686
...4....31.....126.......575........2832........13322..........62874
...7....88.....575......4251.......34086.......261354........2009116
..12...287....2832.....34086......458494......5692727.......71592909
..21...881...13322....261354.....5692727....114153198.....2324267560
..37..2686...62874...2009116....71592909...2324267560....76925689840
..65..8347..299056..15561333...910873718..47816866681..2573555751062
.114.25763.1418177.120192735.11510112796.977475485051.85477431609556
链接
配方奶粉
k列的经验值:
k=1:a(n)=2*a(n-1)-a(n-2)+a(n-3)。
k=2:a(n)=3*a(n-1)-a(n-2)+8*a(n-3)-12*a(n4)+2*a(-n5)-12*a(n-6)。
k=3:[顺序16]。
k=4:[顺序35]。
例子
n=5,k=4的一些解
..0..1..0..0. .1..0..0..0. .0..1..0..1. .1..1..1..1. .1..1..0..0
..1..0..0..0. .1..0..0..0. .1..0..0..1. .0..0..0..0. .0..1..0..0
..0..0..0..0. .1..0..0..0. .0..0..0..0. .0..0..1..1. .1..1..0..0
..1..0..0..0. .0..1..0..0. .0..0..0..0. .1..0..0..0. .1..1..0..0
..0..1..1..0. .0..0..1..0. .0..1..1..1. .1..1..0..0. .0..1..0..0
交叉参考
关键词
非n,
作者
R.H.哈丁2017年12月19日
状态
经核准的