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.

A127610 a(n) = floor(( (n+1)/2 )^n) - n!.

Original entry on oeis.org

0, 0, 0, 2, 15, 123, 1118, 11344, 127831, 1590245, 21700716, 322880256, 5209007463, 90661989607, 1694616510154, 33876697720832, 721588072472639, 16321494271570569, 390811944752490542, 9878354899591168000, 262896868506265373394, 7349159002086450661211
Offset: 0

Views

Author

N. J. A. Sloane, Apr 03 2007

Keywords

Comments

Theorem (Cauchy): ((n+1)/2)^n > n! for n >= 2.

References

  • D. S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970; p. 192, 3.1.14.

Crossrefs

Cf. A127426.

Programs