SmallestNonRepeatedInteger on IntegerPartition
The smallest positive integer that is not a part at least twice.
The integer need not be a part: it is the least k >= 1 with fewer than two parts equal to k.
Called as CombinatorialStat(x, "SmallestNonRepeatedInteger"). 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 St001568
The smallest positive integer that does not appear twice in the partition.
| Object | Value |
|---|---|
[2] | 1 |
[3] | 1 |
[4] | 1 |
[5] | 1 |
[6] | 1 |
[7] | 1 |
[8] | 1 |
[9] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001568 has the rest.