cp's OEIS Frontend

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.

A145421 Decimal expansion of Sum_{k>=2} 1/(k*(log k)^5).

This page as a plain text file.
%I A145421 #16 Feb 10 2022 11:46:18
%S A145421 3,4,2,9,8,1,6,2,6,0,0,2,3,0,5,6,0,6,5,0,2,2,4,1,1,5,8,5,6,5,5,8,6,0,
%T A145421 5,4,0,4,5,2,3,7,6,2,0,0,1,2,0,7,1,0,3,8,9,8,4,8,2,0,0,5,2,0,9,7,4,0,
%U A145421 4,4,4,2,8,3,5,9,4,8,1,6,1,2,1,1,8,7,4,1,9,7,2,3,8,7,3,5,3,4,5,1,6,7,7,4,2
%N A145421 Decimal expansion of Sum_{k>=2} 1/(k*(log k)^5).
%C A145421 Quintic analog of A115563. Evaluated by direct summation of the first 160 terms and accumulating the remainder with the 5 nontrivial terms in the Euler-Maclaurin expansion.
%C A145421 Bertrand series Sum_{n>=2} 1/(n*log(n)^q) is convergent iff q > 1. - _Bernard Schott_, Feb 08 2022
%H A145421 Wikipédia, <a href="https://fr.wikipedia.org/wiki/Série_de_Bertrand">Série de Bertrand</a> (in French).
%e A145421 3.4298162600230560650224115856558605404523762001207...
%t A145421 (* Computation needs a few minutes *) digits = 105; NSum[ 1/(n*Log[n]^5), {n, 2, Infinity}, NSumTerms -> 1500000, WorkingPrecision -> digits + 10, Method -> {"EulerMaclaurin", Method -> {"NIntegrate", "MaxRecursion" -> 10}}] // RealDigits[#, 10, digits] & // First (* _Jean-François Alcover_, Feb 12 2013 *)
%Y A145421 Cf. A115563 (q=2), A145419 (q=3), A145420 (q=4).
%K A145421 cons,nonn
%O A145421 1,1
%A A145421 _R. J. Mathar_, Feb 08 2009
%E A145421 More terms from _Jean-François Alcover_, Feb 12 2013