A326180-OEIS公司

A326180型

包含n且其乘积可被其和整除的{1..n}的最大子集的数目。

0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 11, 1, 16, 1, 1, 1, 27, 1

抵消

0,7

链接

配方奶粉

一个(A060462号（n））=1。

例子

a（6）=3、a（10）=11和a（12）=16子集：

{1,3,5,6} {1,2,4,5,6,7,10} {1,2,3,4,5,6,7,8,12}

{1,2,3,4,6} {1,2,3,4,5,7,8,10} {1,3,4,5,6,7,8,10,12}

{2,3,4,5,6} {1,2,3,4,6,7,9,10} {1,3,4,6,7,8,9,10,12}

{1,2,3,5,6,7,8,10} {1,3,4,5,6,8,10,11,12}

{1,2,3,5,7,8,9,10} {1,2,3,4,5,6,8,9,10,12}

{1,2,5,6,7,8,9,10} {1,2,3,4,6,7,8,9,11,12}

{1,3,4,5,6,7,9,10} {1,2,3,5,6,7,8,9,10,12}

{1,3,4,6,7,8,9,10} {1,2,3,5,6,7,8,9,11,12}

{1,4,5,6,7,8,9,10} {1,3,4,5,6,7,8,9,11,12}

{1,2,3,4,5,6,8,9,10} {1,2,3,4,6,7,8,10,11,12}

{2,3,4,5,6,7,8,9,10} {1,2,3,4,6,8,9,10,11,12}

{1,3,5,6,7,8,9,10,11,12}

{1,2,3,4,5,6,7,9,10,11,12}

{1,2,3,4,5,7,8,9,10,11,12}

{1,2,4,5,6,7,8,9,10,11,12}

{2,3,4,5,6,7,8,9,10,11,12}

数学

fasmax[y_]：=补[y，并@@（大多数[子集[#]]&/@y）]；

表[Length[fasmax[Select[Subsets[Range[n]，{1，n}]，MemberQ[#，n]&&Divisible[Times@@#，Plus@@#]&]]，{n，0，10}]

交叉参考

关键词

非n,更多

作者

状态

经核准的