login
A245617
Decimal expansion of 'chi', a constant appearing in the asymptotic variance of the number of comparisons required for updating a digital search tree, in case of the "approximate counting" algorithm.
0
1, 2, 3, 7, 4, 1, 2, 5, 7, 5, 7, 3, 6, 1, 1, 0, 2, 2, 8, 7, 1, 9, 6, 1, 0, 6, 4, 6, 6, 7, 2, 8, 7, 4, 2, 9, 7, 7, 3, 2, 0, 4, 8, 1, 9, 6, 5, 4, 8, 4, 4, 3, 8, 4, 4, 1, 7, 1, 8, 2, 5, 6, 4, 0, 5, 3, 0, 4, 2, 8, 8, 5, 0, 9, 1, 3, 8, 8, 5, 5, 8, 6, 1, 9, 3, 5, 2, 4, 9, 7, 6, 2, 6, 8, 4, 5, 3, 3, 4, 0
OFFSET
-11,2
REFERENCES
Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.14 Digital Search Tree Constants, p. 359.
FORMULA
chi = (1/log(2))*sum_{n >= 1} (1/n)*csch(2*Pi^2*(n/log(2))) = A245675 - 1.
variance ~ 1/12 + Pi^2/(6log(2)^2) - alpha - beta - chi + tau(n), where alpha is A065442, beta is A065443 and tau(n) an oscillatory negligible function.
EXAMPLE
0.000000000001237412575736110228719610646672874297732...
MAPLE
evalf(1/log(2)*sum(1/n*csch(2*Pi^2*n/log(2)), n=1..infinity), 120) # Vaclav Kotesovec, Nov 05 2014
MATHEMATICA
digits = 100; chi = (1/Log[2])*NSum[(1/n)*Csch[2*Pi^2*(n/Log[2])], {n, 1, Infinity}, WorkingPrecision -> digits+5]; RealDigits[chi, 10, digits] // First
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
STATUS
approved