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 A243533 #9 Feb 16 2025 08:33:22
%S A243533 1,3,5,3,1,3,0,2,7,2,2,9,5,9,3,3,2,8,1,6,5,2,9,4,4,0,3,2,4,9,2,2,5,9,
%T A243533 6,2,6,9,0,8,7,9,0,4,2,4,3,7,1,9,1,1,2,6,4,6,1,2,0,1,7,2,2,6,3,3,0,9,
%U A243533 3,7,0,1,6,4,8,7,3,5,1,8,4,2,2,3,9,6,4,3,0,6,7,4,8,6,0,1,5,4,8,7,4,6,0,1,4
%N A243533 Decimal expansion of 'c', an asymptotic constant related to a variation of the "Secretary problem" with a uniform distribution.
%D A243533 Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.15 Optimal stopping constants, p. 362.
%H A243533 Eric Weisstein's MathWorld, <a href="https://mathworld.wolfram.com/SultansDowryProblem.html">Sultan's Dowry Problem.</a>
%H A243533 Wikipedia, <a href="http://en.wikipedia.org/wiki/Secretary_problem">Secretary problem</a>.
%F A243533 log(A242672).
%F A243533 2*Sum_{k >= 3}(log(k)/(k^2-1)) - log(2)/3.
%e A243533 1.3531302722959332816529440324922596269...
%t A243533 digits = 65; c = 2*NSum[Log[k]/(k^2 - 1), {k, 3, Infinity}, WorkingPrecision -> digits + 10, NSumTerms -> 10^4, Method -> {"EulerMaclaurin", Method -> {"NIntegrate", "MaxRecursion" -> 10, Method -> "DoubleExponential"}}] - (Log[2]/3); RealDigits[c, 10, digits] // First
%Y A243533 Cf. A054404, A242672.
%K A243533 nonn,cons
%O A243533 1,2
%A A243533 _Jean-François Alcover_, Jun 06 2014