搜索： 编号：a213800
|
| |
|
|
113800南非兰特
|
| T（n，k）=每行求和到楼层的n X n 0..k对称阵列的数量（n*k/2） |
|
+0
14
|
|
|
|
1, 1, 2, 1, 3, 4, 1, 4, 13, 18, 1, 5, 29, 169, 112, 1, 6, 57, 880, 5673, 1760, 1, 7, 96, 3249, 87932, 526443, 35150, 1, 8, 153, 9522, 815263, 34725760, 133721189, 1944530, 1, 9, 226, 23753, 4843626, 932587453, 46259653191, 95133854529, 133948836, 1, 10, 323
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,3
|
|
|
评论
|
表格开始
...........1...............1...............1.............1...............1
...........2...............3...............4.............5...............6
...........4..............13..............29............57..............96
..........18.............169.............880..........3249............9522
.........112............5673...........87932........815263.........4843626
........1760..........526443........34725760.....932587453.....13937940952
.......35150.......133721189.....46259653191.4893373431575.212962858290086
.....1944530.....95133854529.250599609089536
...133948836.190409704025737
.26615510712
|
|
|
链接
|
|
|
|
例子
|
n=4k=3的一些解
..1..1..1..3....1..3..2..0....1..3..0..2....0..1..2..3....2..1..2..1
..1..2..3..0....3..1..0..2....3..3..0..0....1..3..2..0....1..0..2..3
..1..3..0..2....2..0..1..3....0..0..3..3....2..2..1..1....2..2..0..2
..3..0..2..1....0..2..3..1....2..0..3..1....3..0..1..2....1..3..2..0
|
|
|
关键词
|
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
搜索在0.003秒内完成
|
