21
$\begingroup$

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.

  • 10
    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, d2012-07-27
  • 1
    @ThomasAndrews, that formula doesn't get any closer to a combinatorial interpretation.2014-03-11
  • 4
    If it did, do you think I might have posted it as an answer? @vonbrand2014-03-11
  • 0
    Well, the later formula suggest one approach. If we can find a faithful action of a group of size $\prod_{d |n, 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....2014-05-26
  • 0
    Something similar-looking: http://math.stackexchange.com/questions/75312015-03-29

1 Answers 1