Let $n$ be a natural number. Let $dc(n)$ be the number of [compositions](https://en.wikipedia.org/wiki/Composition_(combinatorics)) of $n$ where the summands are required to be in the set of divisors of $n$. Standard lore in analytic combinatorics yields the following formula for $dc(n)$:

$$dc(n) = n\text{th Taylor coefficient of }\frac{1}{1- \sum\_{m\in\text{divisors of n}} z^m}.$$

But what are the asymptotics of $dc(n)$? Here's a plot that I made (the y-axis is $dc(n)$ on a log scale and the x-axis is $n$):

[![Compositions from divisors](https://i.stack.imgur.com/r6Fhv.png)](https://i.stack.imgur.com/r6Fhv.png)

I would like to understand the "fanning", which presumably has something to do with whether numbers have lots of small divisors or not, and I would also like to understand why these fans seem to be so close to exponentials. The solid fit line at the top is $2^n$, which is the number of unrestricted compositions.

If that's too much to ask for, I guess I'd like to know how one might use known facts about the number of divisors, etc. to say something about this, as this rather artificial construction ought to be governed by some more fundamental number theoretic functions.