Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #34 Jun 20 2017 23:25:05
%S 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 12,12,12,13,13,13,14,14,15,15,15,16,16,16,17,17,17,18,18,19,19,19,20,
%U 20,20,21,21,22,22,22,23,23,23,24,24,24,25,25,26,26,26
%N 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 It is very similar to the sequence A054404, but differs for example at n=97 (see A226082).
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SultansDowryProblem.html">Sultan's Dowry Problem.</a>
%p A226033 := proc(n)
%p round(n/exp(1+1/2/n)) ;
%p end proc: # _R. J. Mathar_, Jun 09 2013
%t Table[Round[n*E^(-1-1/(2*n))], {n,100}]
%Y Cf. A054404, A225593.
%K nonn
%O 1,5
%A _José María Grau Ribas_, May 24 2013