Simce any number n is a repeated sum of any of its divisors, "sum of distinct divisors" seems like overkill. Anyway, another question: What is the smallest number a(n) that is a sum of its distinct divisors in n ways?