login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226242 Numerators of the probability of success in sultan's dowry problem with n daughters. 3
1, 1, 1, 11, 13, 77, 29, 459, 341, 3349, 251, 32891, 28271, 395243, 420983, 74587, 158183, 2833255, 853661, 3407275, 77976391, 27223837, 28399557, 1814074083, 5665315119, 29397421371, 27452509171, 85332099113, 88200436013 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
Eric Weisstein's World of Mathematics, Sultan's Dowry Problem.
Wikipedia, Secretary problem.
EXAMPLE
1, 1/2, 1/2, 11/24, 13/30, 77/180, 29/70, 459/1120, ...
MATHEMATICA
G[k_, n_] := G[k, n] = 1/( k + 1) Max[(k + 1)/n, G[k + 1, n]] + k/(k + 1)G[k + 1, n]; G[n_, n_] = 0; Numerator@Table[G[0, n], {n, 1, 20}]
PROG
(PARI) a(n)={my(g=0); forstep(k=n-1, 0, -1, g = max(1/n, g/(k+1)) + k*g/(k+1)); numerator(g)} \\ Andrew Howroyd, Nov 12 2018
CROSSREFS
Cf. A226243 (denominators), A054404.
Sequence in context: A057189 A072580 A186640 * A116436 A185240 A056446
KEYWORD
nonn,frac
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 12:53 EDT 2024. Contains 371780 sequences. (Running on oeis4.)