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!)
A226082 Number of daughters to wait before picking in the sultan's dowry problem that is not equal to round(n*e^(-1 - 1/(2*n))). 2
97, 1361, 24586, 73757 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Numbers n such that A054404(n) is not equal to A226033(n).
LINKS
MATHEMATICA
li[n_] := -1/2* 1/ProductLog[-Exp[1 - 1/((2 n - 2))]/(2n-2)]; Table[If[! Round[n*E^(-1 - 1/(2*n))] == Ceiling[li[n]], Print[n]; n], {n, 4, 1000000}]
CROSSREFS
Sequence in context: A133836 A224106 A038532 * A092272 A233433 A162542
KEYWORD
nonn,hard
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 23 05:16 EDT 2024. Contains 371906 sequences. (Running on oeis4.)