cp's OEIS Frontend

A226033 Round(n * exp(-1 - 1/(2n))), an approximation to the number of daughters to wait before picking in the sultan's dowry problem (Better that A225593).

%I A226033 #35 Feb 16 2025 08:33:19
%S A226033 0,1,1,1,2,2,2,3,3,3,4,4,5,5,5,6,6,6,7,7,8,8,8,9,9,9,10,10,10,11,11,
%T A226033 12,12,12,13,13,13,14,14,15,15,15,16,16,16,17,17,17,18,18,19,19,19,20,
%U A226033 20,20,21,21,22,22,22,23,23,23,24,24,24,25,25,26,26,26
%N A226033 Round(n * exp(-1 - 1/(2n))), an approximation to the number of daughters to wait before picking in the sultan's dowry problem (Better that A225593).
%C A226033 It is very similar to the sequence A054404, but differs for example at n=97 (see A226082).
%H A226033 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SultansDowryProblem.html">Sultan's Dowry Problem.</a>
%p A226033 A226033 := proc(n)
%p A226033     round(n/exp(1+1/2/n)) ;
%p A226033 end proc: # _R. J. Mathar_, Jun 09 2013
%t A226033 Table[Round[n*E^(-1-1/(2*n))], {n,100}]
%Y A226033 Cf. A054404, A225593.
%K A226033 nonn
%O A226033 1,5
%A A226033 _José María Grau Ribas_, May 24 2013