Let $D(x)= (x+1)(x^2 +1 ) (x^3 +1 ).... $ and let F(x) be inverse of $D(x)$
I know, that $ D$ is the number of ways to write n as a sum of positive integers without repeated summands. Sums only differing by the order of the summands are counted only once. But I don't see what is inverse for that. Help me.