登录
A296599型
T(n,k)=n X k 0..1阵列的数量,每个1水平、垂直或反对角地与1、2或3相邻。
8
1, 2, 2, 4, 11, 4, 7, 39, 39, 7, 12, 136, 228, 136, 12, 21, 494, 1441, 1441, 494, 21, 37, 1785, 9194, 16524, 9194, 1785, 37, 65, 6432, 58251, 194743, 194743, 58251, 6432, 65, 114, 23201, 370000, 2271055, 4254377, 2271055, 370000, 23201, 114, 200, 83695
抵消
1,2
链接
配方奶粉
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)+4*a(n-3)+a(n-4)+a(n-6)-a(n-7)-a(n-8)
k=3:[顺序17]
k=4:[订单44]
例子
表格开始
...1.....2........4..........7...........12..............21................37
...2....11.......39........136..........494............1785..............6432
...4....39......228.......1441.........9194...........58251............370000
...7...136.....1441......16524.......194743.........2271055..........26487173
..12...494.....9194.....194743......4254377........91004329........1952733110
..21..1785....58251....2271055.....91004329......3553672817......139547279602
..37..6432...370000...26487173...1952733110....139547279602....10046940260800
..65.23201..2348956..309059200..41935988643...5483284264255...723805695940277
.114.83695.14911425.3606151826.900218672974.215325152512080.52099265384617231
...
n=4,k=4的一些解
..0..0..1..0. .0..1..1..0. .0..1..1..0. .0..0..0..1. .0..1..0..0
..0..1..0..0. .0..1..0..0. .1..0..0..1. .0..0..1..1. .1..0..0..0
..1..0..1..1. .0..1..0..1. .0..1..0..1. .1..1..0..0. .1..1..1..0
..1..1..0..1. .0..0..1..0. .0..1..0..1. .0..0..0..0. .0..1..1..1
关键词
非n,
作者
R.H.哈丁2017年12月16日
状态
经核准的