Is there a function, equivalent to the partition function, that does not allow duplication? Or, alternatively, for any N, how many partitions would there be- disallowing any that have the same integer appearing more than once.
Sorry, to be more accurate, I'd like to know a function, or even just it's asymptotic complexity, which will produce the partitions of the input, excepting those which have integers that occur more than once. I've only just realized that this is the actual logical equivalent to my problem; I appreciate that I haven't exactly posted much effort into finding it myself. Unless someone comes back and posts a solution relatively quickly, you can expect more from me soon.