This is similar in spirit to Sum of squares of middle binomial sums or 'Truncated mean' of binomial coefficients under binomial distribution but gives some total estimates. Though the other one was amenable to computations this by nature looks formidable. I do not have much intuition on how fast $f(m,n)$ can grow?

$\mu=1+\epsilon$ where $\epsilon>0$ holds.

$n<m$ holds.

Is there a good bound for $$\log_2\Bigg({\sum_{i_1,\dots,i_{m/n}=-\sqrt{\mu n\ln n}}^{\sqrt{\mu n\ln n}}\binom{n}{\frac n2 +i_1}\dots\binom{n}{\frac n2 +i_{m/n}}}{\mathbb P(\frac n2+i_1)\dots\mathbb P(\frac n2+i_{m/n})}\Bigg)?$$

where $\mathbb P(\frac n2+i)$ is under bionmial distribution and thus is $\frac{\binom{n}{\frac n2 +i}}{2^n}$ and thus this expression is 'truncated joint moment $\binom{n}{\frac n2 +i_j}$ from $j\in\{1,\dots,{m/n}\}$'.

Clearly this is $m-f(m,n)$ (seen from similar nature of terms and bounds from Sum of squares of middle binomial sums or 'Truncated mean' of binomial coefficients under binomial distribution) for some function $f$. How fast can $f(m,n)$ grow?

**Conjecture**: $\exists c>1: f(m,n)>c\frac mn$.

**Question**: Can $c>c'\ln n$ hold in above at some $c'>1$?