A243398 Decimal expansion of the limiting length appearing in the asymptotic probability involved in the "stick breaking" problem.

1, 2, 6, 1, 0, 7, 0, 4, 8, 6, 8, 3, 0, 6, 7, 8, 9, 0, 5, 8, 3, 9, 6, 5, 5, 1, 4, 7, 9, 6, 2, 6, 1, 2, 8, 3, 1, 6, 3, 3, 8, 6, 5, 9, 6, 9, 6, 4, 4, 1, 6, 7, 3, 7, 8, 6, 9, 8, 5, 6, 2, 5, 8, 2, 0, 5, 5, 7, 6, 7, 2, 0, 3, 6, 1, 2, 8, 7, 5, 4, 2, 5, 4, 2, 2, 0, 3, 2, 1, 7, 6, 7, 0, 7, 2, 8, 9, 9, 7, 3

Offset

1,2

References

Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.13 Binary search tree constants, p. 352.

Links

Table of n, a(n) for n=1..100.

Formula

exp(1/c), where c is A195596.

Example

1.26107048683067890583965514796261283...

Mathematica

c = -1/ProductLog[-1/(2*E)]; RealDigits[Exp[1/c], 10, 100] // First

Crossrefs

Cf. A195596.

Sequence in context: A021797 A068959 A285849 * A175474 A271877 A021387

Adjacent sequences: A243395 A243396 A243397 * A243399 A243400 A243401

Keyword

nonn,cons,easy

Author

Jean-François Alcover, Jun 04 2014

Status

approved