This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A354953 #18 Jun 23 2022 12:33:07 %S A354953 3,3,5,9,8,9,8,7,6,0,1,2,7,2,5,3,0,8,8,3,6,4,2,7,4,3,6,8,0,6,3,3,1,3, %T A354953 5,7,0,4,0,7,4,7,2,6,8,9,6,0,3,4,6,9,0,0,4,1,9,4,8,6,3,1,4,0,6,4,5,8, %U A354953 7,2,3,3,6,8,8,3,0,4,0,4,7,7,9,2,1,0,9,8,5,4,8,4,1,4,3,9,2,3,5,5,8,0,8,2,0 %N A354953 Decimal expansion of Sum_{p = primes} 1 / (p * log(p)^5). %H A354953 R. J. Mathar, <a href="https://arxiv.org/abs/0811.4739">Twenty digits of some integrals of the prime zeta function</a>, arXiv:0811.4739 [math.NT], 2008-2018. %e A354953 3.359898760127253088364274368063313570407472689603469004194863140645872... %t A354953 digits = 105; precision = digits + 15; %t A354953 tmax = 400; (* integrand considered negligible beyond tmax *) %t A354953 kmax = 400; (* f(k) considered negligible beyond kmax *) %t A354953 InLogZeta[k_] := NIntegrate[(t-k)^4 Log[Zeta[t]], {t, k, tmax}, %t A354953 WorkingPrecision -> precision, MaxRecursion -> 20, %t A354953 AccuracyGoal -> precision]; %t A354953 f[k_] := With[{mu = MoebiusMu[k]}, If[mu==0, 0, (mu/(4! k^6))* InLogZeta[k]]]; %t A354953 s = 0; Do[s = s + f[k]; Print[k, " ", s], {k, 1, kmax}]; %t A354953 RealDigits[s][[1]][[1 ;; digits]] (* _Jean-François Alcover_, Jun 23 2022 *) %o A354953 (PARI) default(realprecision, 200); s=0; for(k=1, 500, s = s + moebius(k)/(4!*k^6) * intnum(x=k,[[1], 1], (x-k)^4 * log(zeta(x))); print(s)); %Y A354953 Cf. A137245, A319231, A354917, A354954. %K A354953 nonn,cons %O A354953 1,1 %A A354953 _Vaclav Kotesovec_, Jun 13 2022 %E A354953 Last 5 digits corrected by _Vaclav Kotesovec_, Jun 22 2022, following a suggestion from _Jean-François Alcover_