I don't have a reference for this formula, which was given in
Lucian's answer (and also suggested numerically by Yuval Filmus's
answer):
$$
\frac{x^2}{1 - \cos x} =
2\sum_{n = 0}^\infty (-1)^{n - 1}\frac{(2n - 1)B_{2n}}{(2n)!}x^{2n}.
$$
Nor do I know how it would naturally be derived. What follows, meanwhile,
is a derivation that's rather unnatural, because it requires knowledge
in advance of what is to be proved.
The familiar recurrence relation for the Bernoulli numbers, obtained
(for example) by setting the Cauchy product of the series for
$(e^x - 1)/x$ and $x/(e^x - 1)$ equal to $1$, is:
$$
\sum_{r = 0}^{m - 1} \binom{m}{r}B_r = 0 \qquad (m > 1).
$$
I'll also be taking for granted these familiar facts: $B_0 = 1$, $B_1 =
-\frac{1}{2}$, and $B_r = 0$ for all odd $r \geqslant 3$. Taking in
turn $m = 2n + 1$ and $m = 2n + 2$ in the recurrence relation above,
and rearranging the terms involving $B_0$ and $B_1$, we get, for all
$n \geqslant 1$:
\begin{align*}
\sum_{j = 1}^n \binom{2n + 1}{2j}B_{2j} & =
n - \frac{1}{2}, \\
\sum_{j = 1}^n \binom{2n + 2}{2j}B_{2j} & = n.
\end{align*}
Either of these relations can be used to express $B_{2n}$ in terms
of $B_2, B_4, \ldots, B_{2n-2}$ (and of course to get $B_2 =
\frac{1}{6}$ to begin with).
If we multiply out the Cauchy product of the series for
$(1 - \cos x)/x^2$ and $x^2/(1 - \cos x),$ we infer a different
recurrence relation from either of those above, to wit:
$$
\sum_{j = 1}^n (2j - 1)\binom{2n + 2}{2j}B_{2j} = 1,
$$
so it would seem that one possible way to prove the formula given by
Lucian would be to prove this recurrence relation.
To do so, take the relations already obtained, subtract the first
from the second, and use the Pascal's Triangle relation between
binomial coefficients, to get yet another recurrence relation:
$$
\sum_{j = 1}^n \binom{2n + 1}{2j - 1}B_{2j} = \frac{1}{2}.
$$
Hence (one could have taken a different linear combination of the two relations in the first place, but it seemed neater to prove the foregoing identity first):
\begin{gather*}
\sum_{j = 1}^n (2j - 1)\binom{2n + 2}{2j}B_{2j} \\
= \sum_{j = 1}^n 2j\binom{2n + 2}{2j}B_{2j} -
\sum_{j = 1}^n \binom{2n + 2}{2j}B_{2j} \\
= (2n + 2)\sum_{j = 1}^n \binom{2n + 1}{2j - 1}B_{2j} - n \\
= (n + 1) - n = 1,
\end{gather*}
as required.