It is possible if $1/F$ has a representation as a Dirichlet series. To obtain the coefficients, it is useful to know how the product of two Dirichlet series looks. Let hence
$$F(s) = \sum_{n = 1}^{\infty} \frac{a(n)}{n^s}\quad \text{and}\quad G(s) = \sum_{n = 1}^{\infty} \frac{b(n)}{n^s}$$
where both series are absolutely convergent for $\operatorname{Re} s > \sigma_0$. Then we can rearrange and regroup freely for $\operatorname{Re} s > \sigma_0$, and obtain
\begin{align}
F(s)\cdot G(s) &= \Biggl(\sum_{k = 1}^{\infty} \frac{a(k)}{k^s}\Biggr)\cdot \Biggl(\sum_{m = 1}^{\infty} \frac{b(m)}{m^s}\Biggr)\\
&= \sum_{k,m = 1}^{\infty} \frac{a(k)b(m)}{(km)^s}\\
&= \sum_{n = 1}^{\infty} \Biggl(\sum_{k m = n} a(k)b(m)\Biggr)\frac{1}{n^s}\\
&= \sum_{n = 1}^{\infty} \Biggl(\sum_{k \mid n} a(k) b(n/k)\Biggr)\frac{1}{n^s}.
\end{align}
So the product of two Dirichlet series is again a Dirichlet series, and the coefficients $c(n)$ of the product satisfy the relation
$$c(n) = \sum_{k \mid n} a(k)b(n/k),$$
that is, the coefficients of the product are given by the Dirichlet convolution of the coefficients of the factors.
In particular, if $G(s) = \frac{1}{F(s)}$, the product is the constant function $1$, and hence
$$c(n) = \begin{cases}1 &, n = 1\\ 0 &, n > 1.\end{cases}\tag{1}$$
The coefficients of the reciprocal of $F$, if that is representable by a Dirichlet series, are given by the Dirichlet inverse of the coefficients of $F$.
We find that a necessary condition is that $a(1) \neq 0$, and that condition is also sufficient. We can then compute the coefficients of the reciprocal with the recurrence $1$, finding $b(1) = \frac{1}{a(1)}$ and recursively
$$b(n) = -\frac{1}{a(1)} \sum_{\substack{k \mid n\\ k < n}} b(k)a(n/k).$$
If the coefficient sequence $(a(n))$ of $F$ has nice properties - for example if it is multiplicative - one may be able to compute the Dirichlet inverse more efficiently. For multiplicative $(a(n))$, one need only consider prime powers, since the Dirichlet inverse is again multiplicative. The coefficients for arbitrary $n$ are then obtained by multiplying the coefficients for the appropriate prime powers.