cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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))).

Original entry on oeis.org

97, 1361, 24586, 73757
Offset: 1

Views

Author

Keywords

Comments

Numbers n such that A054404(n) is not equal to A226033(n).

Crossrefs

Programs

  • 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}]