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 A325905 #30 Feb 16 2025 08:33:58
%S A325905 2,7,0,6,7,0,5,6,6,4,7,3,2,2,5,3,8,3,7,8,7,9,9,8,9,8,9,9,4,4,9,6,8,8,
%T A325905 0,6,8,1,5,2,6,3,0,9,1,8,1,9,1,5,1,7,6,2,9,3,6,3,1,7,7,4,5,3,0,8,1,4,
%U A325905 6,7,4,8,2,0,2
%N A325905 Decimal expansion of 2/e^2.
%C A325905 Decimal expansion of the asymptotic (n -> inf) probability of success in the secretary problem when the number of applicants is uniformly distributed on {1, 2, ..., n}. It means that less is known than in the basic secretary problem, so this constant is less than A068985 (and also A246665).
%H A325905 E. L. Presman and I. M. Sonin, <a href="http://mi.mathnet.ru/eng/tvp4342">The best choice problem for a random number of objects</a>, Teor. Veroyatnost. i Primenen., 17:4 (1972), 695-706; <a href="https://doi.org/10.1137/1117078">English version</a>, Theory Probab. Appl., 17:4 (1973), 657-668.
%H A325905 Eric Weisstein's MathWorld, <a href="https://mathworld.wolfram.com/SultansDowryProblem.html">Sultan's Dowry Problem</a>
%H A325905 Wikipedia, <a href="http://en.wikipedia.org/wiki/Secretary_problem">Secretary problem</a>
%e A325905 0.2706705664732253837879989899...
%t A325905 N[2/E^2, 100] // RealDigits // First
%Y A325905 Equals twice A092553.
%Y A325905 Cf. A068985, A246665.
%K A325905 nonn,cons
%O A325905 0,1
%A A325905 _José María Grau Ribas_, Sep 08 2019