Another infinite series for which I can't verify the convergence...
SumConvergence[Sin[k!]/(k (k + 1)), k,
Method -> {"RatioTest", "RootTest", "RaabeTest", "IntegralTest"}]
I can calculate the approximate value of the sum with NSum[] with machine precision:
In[57]:= SumConvergence[Sin[k!]/(k (k + 1)), k,
Method -> {"RatioTest", "RootTest", "RaabeTest", "IntegralTest"}]
In[63]:= NSum[Sin[k!]/(k (k + 1)), {k, 1, \[Infinity]}]
During evaluation of In[63]:= NIntegrate::slwcon: Numerical integration converging too slowly; suspect one of the following: singularity, value of the integration is 0, highly oscillatory integrand, or WorkingPrecision too small.
During evaluation of In[63]:= NIntegrate::ncvb: NIntegrate failed to converge to prescribed accuracy after 9 recursive bisections in k near {k} = {45.385}. NIntegrate obtained -0.00397379 and 0.003836148173776894` for the integral and error estimates.
During evaluation of In[63]:= NSum::emcon: Euler-Maclaurin sum failed to converge to requested error tolerance.
Out[63]= 0.541556
We can define a function that may be used to "visualize" the behavior of partial sums:
f[n_] := Sum[Sin[k!]/(k (k + 1)), {k, 1, n}]
Plot[f[n], {n, 1, 33}, PlotRange -> {{0, 33}, {0.2, 0.72}}]

It seems that the series is convergent. We can refer the "policemen" rule in this context. But, can we test simply in Mathematica the convergence of this series?
Can we compute the sum with a greater precision and accuracy?