We will prove that the sum converges to $\pi^2/16$.
Note first that the sum does not converge absolutely, so we are not free to rearrange it arbitrarily. For that matter, the standard alternating sum test does not apply because the absolute values of the terms does not decrease to 0, so even the convergence of the sum must be established by hand.

Setting these issues aside momentarily, note that
the elements of the set counted by $A(k)$ are those odd positive integers $d$ for which $m = k/d$ is also an integer and $d < \sqrt{2dm}$; if we write $\text{d = 2 -1}$, then the condition on $m$ reduces to $\text{m}$. In other words, the original sum equals
$$\text{S 1 := k=1 1, m k = m(2 -1) (-1) m-1 m(2 -1) ,}$$
and we would like to rearrange this to
$$\text{S 2 := =1 1 2 -1 m= (-1) m-1 m ,}$$
in which both sums converge by the alternating sum test. In fact a bit more is true:
we have
$$\text{| m= (-1) m-1 m | < 1 ,}$$
so the outer sum converges absolutely.
In particular, $S_2$ is the limit of the truncated sums
$$\text{S 2,n = (2 -1) n 1 2 -1 m= (-1) m-1 m .}$$
To see that $S_1$ converges to the same value as $S_2$, write
$$\text{S 2,n - k=1 n (-1) k-1 A(k) k = (2 -1) n 1 2 -1 m= n 2 -1 +1 (-1) m-1 m .}$$
The expression on the right is bounded above in absolute value by the sum $\text{(2 -1) n 1 n}$, in which the number of summands is
%at most $\sqrt{n/2}$ and so the total is bounded by $1/\sqrt{2n}$.
at most $\sqrt{n}$ (since $\sqrt{n}(2\sqrt{n}-1)\geq n$), and so the total is bounded above by $1/\sqrt{n}$.
Hence the difference converges to zero as $n \to \infty$; that is, $S_1$ converges and equals $S_2$.

We may thus focus hereafter on computing $S_2$. We begin by writing
$$\text{S 2 = =1 1 2 -1 m= (-1) m-1 0 1 t m-1 ,dt.}$$
Our next step will be to interchange the inner sum and the integral, but again this requires some justification.
$\text{}$
Let $f_0, f_1, \dots$ be a sequence of continuous functions on $[0,1]$ such that for each $x \in [0,1]$, we have
$$f_0(x) \geq f_1(x) \geq \cdots \geq 0.$$
Then
$$\sum_{n=0}^\infty (-1)^n \int_0^1 f_n(t)\,dt = \int_0^1 \left( \sum_{n=0}^\infty (-1)^n f_n(t) \right)\,dt$$
provided that both sums converge.
$\text{}$
Put $g_n(t) = f_{2n}(t) - f_{2n+1}(t) \geq 0$; we may then rewrite the desired equality as
$$\sum_{n=0}^\infty \int_0^1 g_n(t) \,dt = \int_0^1 \left( \sum_{n=0}^\infty g_n(t) \right)\,dt,$$
which is a case of the Lebesgue monotone convergence theorem.
$\text{}$
By Lemma~1, we have
$$\text{S 2 = =1 1 2 -1 0 1 ( m= (-1) m-1 t m-1 ) ,dt = =1 1 2 -1 0 1 (-t) -1 1+t ,dt.}$$
Since the outer sum is absolutely convergent, we may freely interchange it with the integral:
$$\text{S 2 = 0 1 ( =1 1 2 -1 (-t) -1 1+t ) ,dt = 0 1 1 t (1+t) ( =1 (-1) -1 t -1/2 2 -1 ) ,dt = 0 1 1 t (1+t) ( t ) ,dt = 0 1 2 1+u 2 (u) ,du (u = t ) = (1) 2 - (0) 2 = 2 16 .}$$