|
|
A319318型 |
| n的整数分区数,使得每个不同的子多重集具有不同的GCD。 |
|
11
|
|
|
1, 1, 1, 1, 2, 1, 3, 2, 3, 3, 5, 2, 6, 5, 5, 5, 8, 5, 9, 6, 8, 9, 11, 6, 11, 11, 11, 10, 14, 9, 16, 12, 14, 15, 15, 11, 19, 17, 17, 14, 22, 15, 22, 18, 18, 21, 25, 16, 24, 21, 23, 22, 28, 21, 26, 22, 26, 27, 32, 20, 35, 30, 27, 27, 31, 27, 38, 30, 33, 29
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,5
|
|
评论
|
请注意,这样的分区必须严格。
|
|
链接
|
|
|
例子
|
a(31)=16个分区是(31),(16,15),(17,14),(18,13),(19,12),(20,11),(21,10),(22,9),(23,8),(24,7),(25,6),(26,5),(27,4),(28,3),(29,2),(15,10,6)。
|
|
数学
|
表[Length[Select[Integer Partitions[n],UnsameQ@@#&UnsameQ@@GCD@@@Union[Rest[Subsets[#]]&]],{n,30}]
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|