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 A242672 #14 Feb 16 2025 08:33:22
%S A242672 3,8,6,9,5,1,9,2,4,1,3,9,7,9,9,9,4,9,5,6,9,4,1,6,7,2,7,8,7,7,9,0,8,3,
%T A242672 4,3,2,1,9,4,6,0,6,4,3,2,5,1,9,6,9,3,3,4,4,0,4,3,9,6,0,8,9,1,1,7,0,5,
%U A242672 9,6,2,9,9,7,8,9,8,0,3,1,5,6,0,7,0,3,6,0,6,6,7,6,1,8,4,9,3,0,8,7,1,9,7,5,7,5
%N A242672 Decimal expansion of an optimal stopping constant related to the Secretary problem.
%D A242672 Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.15, p. 362.
%H A242672 Eric Weisstein's MathWorld, <a href="https://mathworld.wolfram.com/SultansDowryProblem.html">Sultan's Dowry Problem.</a>
%H A242672 Wikipedia, <a href="http://en.wikipedia.org/wiki/Secretary_problem">Secretary problem</a>.
%F A242672 product_(k>0) (1+2/k)^(1/(k+1)).
%F A242672 Also equals exp(2*Sum_{k>=3} (log(k)/(k^2-1)) - log(2)/3).
%e A242672 3.869519241397999495694167278779...
%t A242672 NProduct[(1+2/k)^(1/(k+1)), {k, 1, Infinity}, NProductFactors -> 1000, WorkingPrecision -> 48] // RealDigits[#, 10, 40]& // First
%Y A242672 Cf. A054404, A242673, A242674.
%K A242672 nonn,cons
%O A242672 1,1
%A A242672 _Jean-François Alcover_, May 20 2014
%E A242672 More terms from _Alois P. Heinz_, Jun 06 2014