登录
269646元
T(n,k)=包含0..n-1的k个副本的nXk数组的数量,避免了每行中的模式向下,每列中的模式相等。
4
1, 1, 2, 1, 6, 6, 1, 14, 74, 24, 1, 34, 574, 1880, 120, 1, 92, 4564, 68876, 80316, 720, 1, 258, 41526, 2316638, 18375702, 5141864, 5040, 1, 722, 419516, 94747953, 3291772332, 9213264418, 458608016, 40320, 1, 2022, 4351224, 4581555620
抵消
1,3
评论
表格开始
......1...........1.............1..............1............1..........1
......2...........6............14.............34...........92........258
......6..........74...........574...........4564........41526.....419516
.....24........1880.........68876........2316638.....94747953.4581555620
....120.......80316......18375702.....3291772332.740782304804
....720.....5141864....9213264418.10673009972228
...5040...458608016.7725775442284
..40320.54247835568
.362880
链接
例子
n=3k=4的一些解
..1..1..0..0. .1..1..2..1. .0..2..2..2. .0..1..2..2. .2..2..1..1
..2..2..2..1. .2..0..0..2. .1..2..1..1. .1..2..1..0. .1..0..0..2
..2..0..0..1. .2..1..0..0. .1..0..0..0. .2..1..0..0. .1..2..0..0
关键词
非n,
作者
R.H.哈丁2016年3月2日
状态
经核准的