|
|
A243398
|
|
Decimal expansion of the limiting length appearing in the asymptotic probability involved in the "stick breaking" problem.
|
|
3
|
|
|
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
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.13 Binary search tree constants, p. 352.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
1.26107048683067890583965514796261283...
|
|
MATHEMATICA
|
c = -1/ProductLog[-1/(2*E)]; RealDigits[Exp[1/c], 10, 100] // First
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|