login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226046 Number of daughters to wait before picking in sultan's dowry problem with an unknown number of daughters  between 1 and n with equal probability. 0

%I

%S 0,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,

%T 4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,9,9,9,

%U 9,9,9,9,10,10,10,10,10,10,10,10,11,11,11

%N Number of daughters to wait before picking in sultan's dowry problem with an unknown number of daughters between 1 and n with equal probability.

%t PR[n_, r_] := Sum[r/((k - 1)i n), {i, 1, n}, {k, r + 1, i}]; maxi[li_] := {Do[If[li[[n + 1]] < li[[n]], aux = n; Break[]], {n, 1, Length[li] - 1}], aux}[[2]]; SEQ[1] = 0; SEQ[2] = 1; SEQ[n_] := maxi[Table[PR[n, i], {i, 1, n - 1}]]; Table[SEQ[n], {n, 1, 133}]

%Y Cf. A054404.

%K nonn

%O 1,15

%A _José María Grau Ribas_, May 24 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 10:35 EDT 2020. Contains 335722 sequences. (Running on oeis4.)