SubsetGreatestCommonDivisorSum on IntegerPartition
The sum, over the non-empty subsets of the parts, of their greatest common divisor: the sum over d of phi(d) times one less than 2 to the number of parts divisible by d.
Called as CombinatorialStat(x, "SubsetGreatestCommonDivisorSum"). The head's page has its examples.
Live
Distribution
Over IntegerPartitions at each size, tallied here in your browser; sizes past 30 are not offered.
FindStat St001985
The sum of the greatest common divisors of all subsets of the parts of an integer partition.
| Object | Value |
|---|---|
[1] | 1 |
[2] | 2 |
[3] | 3 |
[4] | 4 |
[5] | 5 |
[6] | 6 |
[7] | 7 |
[8] | 8 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001985 has the rest.