The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A246750 Duplicate of A234614. 0
 8, 1, 7, 8, 1, 4, 6, 4, 0, 0, 8, 3, 6, 3, 2, 2, 3, 1, 5, 2, 5, 5, 9, 6, 8, 0, 0, 9, 0, 2, 9, 6, 5, 6, 0, 3, 8, 6, 4, 8, 5, 2, 9, 8, 2, 3, 7, 8, 9, 9, 1, 7, 8, 6, 3, 8, 6, 1, 2, 6, 3, 2, 0, 4, 2, 9, 7, 9, 1, 0, 0, 5, 2, 4, 5, 4, 9, 6, 4, 2, 1, 9, 6, 7, 0, 4, 6, 1, 9, 3, 7, 6, 4, 1, 9, 6, 7, 5, 0, 3, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Steven R. Finch, Errata and Addenda to Mathematical Constants, p. 16. Kevin Ford, The distribution of Totients FORMULA Let F(x) = sum_{k >= 1} ((k+1)*log(k+1) - k*log(k) - 1)*x^k. C = 1/(2*|log(rho)|), where rho is the unique solution on [0,1) of F(rho)=1, EXAMPLE -0.81781464008363223152559680090296560386485298237899178638612632... MATHEMATICA digits = 101; F[x_?NumericQ] := NSum[((k + 1)*Log[k + 1] - k*Log[k] - 1)*x^k, {k, 1, Infinity}, WorkingPrecision -> digits + 10, NSumTerms -> 1000]; rho = x /. FindRoot[F[x] == 1, {x, 5/10, 6/10}, WorkingPrecision -> digits + 10]; RealDigits[-1/(2*Log[rho]), 10, digits] // First CROSSREFS Cf. A246746. Sequence in context: A242024 A159642 A234614 * A199872 A143548 A231929 Adjacent sequences:  A246747 A246748 A246749 * A246751 A246752 A246753 KEYWORD dead AUTHOR Jean-François Alcover, Sep 02 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 15 00:32 EDT 2020. Contains 336484 sequences. (Running on oeis4.)