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.

A226033 Round(n * exp(-1 - 1/(2n))), an approximation to the number of daughters to wait before picking in the sultan's dowry problem (Better that A225593).

Original entry on oeis.org

0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 19, 19, 19, 20, 20, 20, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 25, 25, 26, 26, 26
Offset: 1

Views

Author

Keywords

Comments

It is very similar to the sequence A054404, but differs for example at n=97 (see A226082).

Crossrefs

Programs

  • Maple
    A226033 := proc(n)
        round(n/exp(1+1/2/n)) ;
    end proc: # R. J. Mathar, Jun 09 2013
  • Mathematica
    Table[Round[n*E^(-1-1/(2*n))], {n,100}]