login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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

Table of n, a(n) for n=1..4.

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

Cf. A054404, A226033.

Sequence in context: A133836 A224106 A038532 * A092272 A233433 A162542

Adjacent sequences:  A226079 A226080 A226081 * A226083 A226084 A226085

KEYWORD

nonn,hard

AUTHOR

José María Grau Ribas, May 25 2013

STATUS

approved

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 December 7 09:33 EST 2019. Contains 329843 sequences. (Running on oeis4.)