The product $$\prod_{p\text{ prime}}\frac{p^n}{p^n-1}=\zeta(n)$$ is well-known. This works over primes, and only over the entire set of them.
Is any similar expression known for composites? For a finite subset of them?
e.g. $$\prod_{c\text{ composite, c}=c_{i}}^{c=c_{j}}\frac{c^n}{c^n-1}=f(m)$$ for some $f$.
This is generic. If such an expression is not known, is anything known for the case $i=1$ and $n=1$? If not, then for $i=n=1$ and $j=\infty$? If that is also not known, is anything known on $\lim \inf f(m)$ or $\lim \sup f(m)$?
Surely we can say something in the case of the set of all composite numbers and for an integer exponent. From the following representation of Gamma function $$\Gamma\left(z\right)=\lim_{n\rightarrow+\infty}\frac{n^{z-1}n!}{z\left(z+1\right)\cdots\left(z+n-1\right)}$$ it is possible to prove that $$\prod_{n\geq0}\frac{\left(n+a_{1}\right)\cdots\left(n+a_{k}\right)}{\left(n+b_{1}\right)\cdots\left(n+b_{k}\right)}=\frac{\Gamma\left(b_{1}\right)\cdots\Gamma\left(b_{k}\right)}{\Gamma\left(a_{1}\right)\cdots\Gamma\left(a_{k}\right)},\,a_{1}+\dots+a_{k}=b_{1}+\dots+b_{k}$$ for $a_{i},b_{j}\in\mathbb{C}\setminus\mathbb{Z}^{-},$ (see Whittaker and Watson, A course of modern analysis, $4$th edition, Cambridge University Press, Cambridge, $1927$, section $12.13$) then if $k>1$ is a positive integer we have $$\prod_{n\geq2}\frac{n^{k}}{n^{k}-1}=\prod_{n\geq0}\frac{\left(n+2\right)^{k}}{\left(n+2-\omega_{0}^{k}\right)\cdots\left(n+2-\omega_{k-1}^{k}\right)}=\frac{\Gamma\left(2-\omega_{0}^{k}\right)\cdots\Gamma\left(2-\omega_{k-1}^{k}\right)}{\Gamma\left(2\right)^{k}}$$ where $\omega_{j}^{k}=\exp\left(\frac{2\pi ij}{k}\right)$. Then, since $\Gamma(2)=\Gamma(1)=1$, $$\prod_{c\text{ composite}}\frac{c^{k}}{c^{k}-1}=\color{red}{\frac{\Gamma\left(2-\omega_{1}^{k}\right)\cdots\Gamma\left(2-\omega_{k-1}^{k}\right)}{\zeta\left(k\right)}}.$$ ADDENDUM: I think it is interesting to see how the answer of Daniel D. is linked to mine; from the power series $$\sum_{n\geq2}\frac{\left(-1\right)^{n}x^{n}\zeta\left(n\right)}{n}=\gamma x+\log\left(\Gamma\left(x+1\right)\right),\,-1<x\leq1$$ we have $$\sum_{n\geq2}\frac{\left(-1\right)^{n}x^{n}\left(\zeta\left(n\right)-1\right)}{n}=\left(\gamma-1\right)x+\log\left(\Gamma\left(x+1\right)\right)+\log\left(\left(x+1\right)\right)$$ which can be extended to $x=-1$ and where $\gamma$ is the Euler-Mascheroni constant. Now recalling that if $f(x)=\sum_{n\geq0}a_{n}x^{n}$ then we have the multisection formula $$\sum_{n\geq0}a_{qn+p}x^{qn+p}=\frac{1}{q}\sum_{j=0}^{q-1}\omega_{q}^{-jp}f\left(\omega_{q}^{j}x\right)$$ where $\omega_{q}^{j}$ is a primitive $q$-root of the unity, we get, assuming that $f(x):=\left(\gamma-1\right)x+\log\left(\Gamma\left(x+1\right)\right)+\log\left(\left(x+1\right)\right)$ and $m>1$, that $$\sum_{n\geq1}\frac{\zeta\left(mn\right)-1}{n}=\lim_{x\rightarrow-1^{+}}\sum_{j=0}^{m-1}f\left(\omega_{m}^{j}x\right)=\color{red}{\sum_{j=1}^{m-1}\log\left(\Gamma\left(2-\omega_{m}^{j}\right)\right)}.$$ Notice that we used the relations $\sum_{j=0}^{q-1}\omega_{q}^{j}=0$ and $$\lim_{x\rightarrow-1^{+}}\left[\log\left(\Gamma\left(x+1\right)\right)+\log\left(\left(x+1\right)\right)\right]$$ $$=\lim_{x\rightarrow-1^{+}}\left[\log\left(\Gamma\left(x\omega_{q}^{0}+1\right)\right)+\log\left(\left(x\omega_{q}^{0}+1\right)\right)\right]=0.$$