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.
%I A243398 #5 Jun 04 2014 13:44:34 %S A243398 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, %T A243398 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, %U A243398 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 %N A243398 Decimal expansion of the limiting length appearing in the asymptotic probability involved in the "stick breaking" problem. %D A243398 Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.13 Binary search tree constants, p. 352. %F A243398 exp(1/c), where c is A195596. %e A243398 1.26107048683067890583965514796261283... %t A243398 c = -1/ProductLog[-1/(2*E)]; RealDigits[Exp[1/c], 10, 100] // First %Y A243398 Cf. A195596. %K A243398 nonn,cons,easy %O A243398 1,2 %A A243398 _Jean-François Alcover_, Jun 04 2014