Solution: We are to partition 7 distinguishable artifacts into 3 indistinguishable non-empty containers. This is equivalent to finding the Stirling numbers of the second kind, denoted $ S(n, k) $, which count the number of ways to partition $ n $ distinguishable objects into $ k $ non-empty indistinguishable subsets. - Crosslake