Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $\mu$ denote the Moebius function. What is a combinatorial interpretation of the following integer, \begin{align} \prod_{d \mid n} d!^{\,\mu(n/d)}, \end{align} where the product is taken over divisors of $n$? Does it have a simpler representation in terms of known functions? Note: The Online Encyclopedia of Integer Sequences does not have an entry containing the corresponding sequence.

share|improve this question
You can take the log and use Mobius inversion to show that (if $f$ is your function,) then $n! = \prod_{d|n} f(d)$. That lets you compute $f(n)$ recursively as $$\frac{n!}{\prod_{d|n, d<n} f(d)}$$ –  Thomas Andrews Jul 27 '12 at 17:40
@ThomasAndrews, that formula doesn't get any closer to a combinatorial interpretation. –  vonbrand Mar 11 '14 at 2:19
If it did, do you think I might have posted it as an answer? @vonbrand –  Thomas Andrews Mar 11 '14 at 3:18
Well, the later formula suggest one approach. If we can find a faithful action of a group of size $\prod_{d |n, d<n} f(d)$ on $S_{n}$, then that formula will count the orbits of that action. Now, I don't know what that group or action might be, but.... –  coolpapa May 26 '14 at 7:48

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.