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 A322166 #28 Feb 11 2019 21:23:31 %S A322166 4,7,0,9,2,6,5,4,3,9,1,8,9,8,6,9,2,9,7,7,0,0,7,3,4,3,9,2,0,9,6,0,6,7, %T A322166 6,0,6,9,7,3,1,3,9,2,2,3,7,2,6,5,1,7,2,6,0,8,5,4,9,3,6,4,6,4,0,7,3,2, %U A322166 5,4,8,6,3,5,7,9,9,5,9,0 %N A322166 Decimal expansion of 2/W(2*e^5), where W is the Lambert W function. %C A322166 n*c is the asymptotic optimal threshold in the returning secretary problem, where n represents the number of pairs of twins. %H A322166 B. Garrod, <a href="https://doi.org/10.1137/09076845X">How to choose the best twins</a>, Siam J. Discrete Math Vol. 26, No. 1, pp. 384-398. 2012. %H A322166 J. M. Grau Ribas <a href="https://doi.org/10.1007/s10878-018-0349-8">A new look at the returning secretary problem</a>, Journal of Combinatorial Optimization, 2018 %e A322166 0.4709265439189869297700734392096067... %p A322166 evalf[90](2/LambertW(2*exp(5))); # _Muniru A Asiru_, Dec 21 2018 %t A322166 First@RealDigits@N[2/ProductLog[2*E^5], 100] %o A322166 (PARI) 2/lambertw(2*exp(5)) \\ _Michel Marcus_, Dec 21 2018 %Y A322166 Cf. A322167. %K A322166 nonn,cons %O A322166 0,1 %A A322166 _José María Grau Ribas_, Nov 29 2018